Sciweavers

2661 search results - page 314 / 533
» Quantum Complexity Classes
Sort
View
ATAL
2003
Springer
15 years 7 months ago
An exploration of bugs and debugging in multi-agent systems
Debugging multi-agent systems, which are concurrent, distributed, and consist of complex components, is difficult, yet crucial. In earlier work we have proposed mechanisms whereby...
David Poutakidis, Lin Padgham, Michael Winikoff
ASYNC
1997
IEEE
103views Hardware» more  ASYNC 1997»
15 years 7 months ago
Efficient Timing Analysis Algorithms for Timed State Space Exploration
This paper presents new timing analysis algorithms for efficient state space exploration during timed circuit synthesis. Timed circuits are a class of asynchronous circuits that i...
Wendy Belluomini, Chris J. Myers
AAAI
2008
15 years 6 months ago
Multiagent Graph Coloring: Pareto Efficiency, Fairness and Individual Rationality
We consider a multiagent extension of single-agent graph coloring. Multiple agents hold disjoint autonomous subgraphs of a global graph, and every color used by the agents in colo...
Yaad Blum, Jeffrey S. Rosenschein
129
Voted
AAAI
2007
15 years 6 months ago
Randomized Adaptive Spatial Decoupling for Large-Scale Vehicle Routing with Time Windows
In recent years, the size of combinatorial applications and the need to produce high-quality solutions quickly have increased steadily, providing significant challenges for optim...
Russell Bent, Pascal Van Hentenryck
AAAI
2007
15 years 6 months ago
Anytime Coordination Using Separable Bilinear Programs
Developing scalable coordination algorithms for multi-agent systems is a hard computational challenge. One useful approach, demonstrated by the Coverage Set Algorithm (CSA), explo...
Marek Petrik, Shlomo Zilberstein