Sciweavers

1884 search results - page 95 / 377
» Simple Algorithm for Simple Timed Games
Sort
View
RAS
2007
103views more  RAS 2007»
14 years 11 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
ICALP
2004
Springer
15 years 5 months ago
Easily Refutable Subformulas of Large Random 3CNF Formulas
Abstract. A simple nonconstructive argument shows that most 3CNF formulas with cn clauses (where c is a large enough constant) are not satisfiable. It is an open question whether ...
Uriel Feige, Eran Ofek
HYBRID
2003
Springer
15 years 5 months ago
Model Checking LTL over Controllable Linear Systems Is Decidable
Abstract. The use of algorithmic verification and synthesis tools for hybrid systems is currently limited to systems exhibiting simple continuous dynamics such as timed automata o...
Paulo Tabuada, George J. Pappas
APPROX
2009
Springer
105views Algorithms» more  APPROX 2009»
14 years 9 months ago
Real-Time Message Routing and Scheduling
Abstract. Exchanging messages between nodes of a network (e.g., embedded computers) is a fundamental issue in real-time systems involving critical routing and scheduling decisions....
Ronald Koch, Britta Peis, Martin Skutella, Andreas...
SIGMETRICS
2006
ACM
156views Hardware» more  SIGMETRICS 2006»
15 years 5 months ago
Maximizing throughput in wireless networks via gossiping
A major challenge in the design of wireless networks is the need for distributed scheduling algorithms that will efficiently share the common spectrum. Recently, a few distributed...
Eytan Modiano, Devavrat Shah, Gil Zussman