Results 1 - 10 of 138

Learnability in Optimality Theory

by Bruce Tesar, Paul Smolensky , 1995
"... In this article we show how Optimality Theory yields a highly general Constraint Demotion principle for grammar learning. The resulting learning procedure specifically exploits the grammatical structure of Optimality Theory, independent of the content of substantive constraints defining any given gr ..."
Abstract - Cited by 529 (35 self) - Add to MetaCart
grammatical module. We decompose the learning problem and present formal results for a central subproblem, deducing the constraint ranking particular to a target language, given structural descriptions of positive examples. The structure imposed on the space of possible grammars by Optimality Theory allows

Solving distributed constraint optimization problems using cooperative mediation

by Roger Mailler, Victor Lesser - In Proceedings of AAMAS , 2004
"... Distributed Constraint Optimization Problems (DCOP) have, for a long time, been considered an important research area for multi-agent systems because a vast number of realworld situations can be modeled by them. The goal of many of the researchers interested in DCOP has been to find ways to solve th ..."
Abstract - Cited by 188 (6 self) - Add to MetaCart
cooperative mediation. The key ideas used by this algorithm are that agents, when acting as a mediator, centralize relevant portions of the DCOP, that these centralized subproblems overlap, and that agents increase the size of their subproblems as the problem solving unfolds. We present empirical evidence

Frequency estimation of internet packet streams with limited space

by Erik D. Demaine, Alejandro López-ortiz, J. Ian Munro - IN PROCEEDINGS OF THE 10TH ANNUAL EUROPEAN SYMPOSIUM ON ALGORITHMS , 2002
"... We consider a router on the Internet analyzing the statistical properties of a TCP/IP packet stream. A fundamental difficulty with measuring traffic behavior on the Internet is that there is simply too much data to be recorded for later analysis, on the order of gigabytes a second. As a result, net ..."
Abstract - Cited by 168 (1 self) - Add to MetaCart
, network routers can collect only relatively few statistics about the data. The central problem addressed here is to use the limited memory of routers to determine essential features of the network traffic stream. A particularly difficult and representative subproblem is to determine the top k categories

Asynchronous partial overlay: A new algorithm for solving distributed constraint satisfaction problems

by Roger Mailler, Victor R. Lesser - Journal of Artificial Intelligence Research (JAIR , 2006
"... Distributed Constraint Satisfaction (DCSP) has long been considered an important problem in multi-agent systems research. This is because many real-world problems can be represented as constraint satisfaction and these problems often present themselves in a distributed form. In this article, we pres ..."
Abstract - Cited by 35 (5 self) - Add to MetaCart
, that these centralized subproblems overlap, and that agents increase the size of their subproblems along critical paths within the DCSP as the problem solving unfolds. We present empirical evidence that shows that APO outperforms other known, complete DCSP techniques. 1.

PCDPOP: A partial centralization extension of DPOP

by Adrian Petcu, Boi Faltings - In In Proceedings of the Second International Workshop on Distributed Constraint Satisfaction Problems, ECAI’06, Riva del Garda , 2006
"... Abstract. A number of algorithms have been recently proposed for distributed constraint optimization problems (DCOP). Fully decentralized examples include ADOPT [11] (search) or DPOP [12] (dynamic programming). Difficult optimization problems have been shown to require important amounts of communica ..."
Abstract - Cited by 4 (4 self) - Add to MetaCart
of communication by centralizing parts of the problem, and solving them with a centralized algorithm. OptAPO [7] is such a hybrid. It operates as a cooperative mediation process, where agents designated as mediators centralize subproblems and solve them in dynamic and asynchronous mediation sessions. The authors

Centralized Path Planning for Multiple Robots: Optimal Decoupling into Sequential Plans

by Jur van den Berg, Jack Snoeyink, Ming Lin, Dinesh Manocha , 2009
"... We develop an algorithm to decouple a multi-robot path planning problem into subproblems whose solutions can be executed sequentially. Given an external path planner for general configuration spaces, our algorithm finds an execution sequence that minimizes the dimension of the highest-dimensional s ..."
Abstract - Cited by 23 (0 self) - Add to MetaCart
We develop an algorithm to decouple a multi-robot path planning problem into subproblems whose solutions can be executed sequentially. Given an external path planner for general configuration spaces, our algorithm finds an execution sequence that minimizes the dimension of the highest

Adaptive Packet Routing for Bursty Adversarial Traffic

by William Aiello, Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosen , 1998
"... One of the central tasks of networking is packet-routing when edge bandwidth is limited. Tremendous progress has been achieved by separating the issue of routing into two conceptual sub-problems: path selection and congestion resolution along the selected paths. However, this conceptual separatio ..."
Abstract - Cited by 62 (7 self) - Add to MetaCart
One of the central tasks of networking is packet-routing when edge bandwidth is limited. Tremendous progress has been achieved by separating the issue of routing into two conceptual sub-problems: path selection and congestion resolution along the selected paths. However, this conceptual

Learnability in Optimality Theory (short version)

by Bruce Tesar , Paul Smolensky , 1996
"... A central claim of Optimality Theory is that grammars may differ only in how conflicts among universal well-formedness constraints are resolved: a grammar is precisely a means of resolving such conflicts via a strict priority ranking of constraints. It is shown here how this theory of Universal Gram ..."
Abstract - Cited by 6 (2 self) - Add to MetaCart
is decomposed and formal results are presented for a central subproblem, deducing the constraint ranking particular to a target language, given structural descriptions of positive examples and knowledge of universal grammatical elements. Despite the potentially large size of the space of possible grammars

Cooperative multihop broadcast for wireless networks

by Ivana Maric, Student Member, Roy D. Yates - IEEE J. Sel. Areas Commun , 2004
"... Abstract—We address the minimum-energy broadcast problem under the assumption that nodes beyond the nominal range of a transmitter can collect the energy of unreliably received overheard signals. As a message is forwarded through the network, a node will have multiple opportunities to reliably recei ..."
Abstract - Cited by 67 (1 self) - Add to MetaCart
employing two subproblems. First, we identify the ordering in which nodes should transmit. Second, we determine the optimum power levels for that ordering. While the second subproblem can be solved by means of linear programming, the ordering subproblem is found to be NP-complete. We devise a heuristic

Central Tehran Branch, Islamic Azad University,

by Mohsen Jahanshahi, Mehdi Dehghan, Mohammad Reza Meybodi
"... Abstract: Multicast is a key networking service, enabling one-shot delivery of information from a source to multiple destinations and is considered underlying for collaborating multimedia applications such as video conferencing, distance learning and other forms of content distributing over Multi-Ch ..."
Abstract - Add to MetaCart
heuristic or meta-heuristic strategies which basically take on a sequential approach to solve the channel assignment and the multicast routing as two disjoint sub-problems. The resulting network configurations would be sub-optimal in this case. It is given that the cross-interaction between the two sub-problems
Results 1 - 10 of 138