Sciweavers

314 search results - page 39 / 63
» Complete Problems for Dynamic Complexity Classes
Sort
View
RAS
2007
103views more  RAS 2007»
14 years 9 months ago
A decomposition approach to multi-vehicle cooperative control
We use a decomposition approach to generate cooperative strategies for a class of multi-vehicle control problems. By introducing a set of tasks to be completed by the team of vehi...
Matthew G. Earl, Raffaello D'Andrea
74
Voted
ECCC
2008
98views more  ECCC 2008»
14 years 9 months ago
Closed Timelike Curves Make Quantum and Classical Computing Equivalent
While closed timelike curves (CTCs) are not known to exist, studying their consequences has led to nontrivial insights in general relativity, quantum information, and other areas....
Scott Aaronson, John Watrous
WSC
2007
15 years 16 hour ago
Hierarchical planning and multi-level scheduling for simulation-based probabilistic risk assessment
Simulation of dynamic complex systems—specifically, those comprised of large numbers of components with stochastic behaviors—for the purpose of probabilistic risk assessment f...
Hamed Nejad, Dongfeng Zhu, Ali Mosleh
ALGORITHMICA
2006
138views more  ALGORITHMICA 2006»
14 years 9 months ago
Planar Graph Coloring Avoiding Monochromatic Subgraphs: Trees and Paths Make It Difficult
We consider the problem of coloring a planar graph with the minimum number of colors so that each color class avoids one or more forbidden graphs as subgraphs. We perform a detail...
Hajo Broersma, Fedor V. Fomin, Jan Kratochví...
CONPAR
1992
15 years 1 months ago
Analysis of an Efficient Distributed Algorithm for Mutual Exclusion (Average-Case Analysis of Path Reversal)
The algorithm designed in [12, 15] was the very first distributed algorithm to solve the mutual exclusion problem in complete networks by using a dynamic logical tree structure as...
Christian Lavault