Sciweavers

18090 search results - page 3037 / 3618
» Computing by Only Observing
Sort
View
ACSD
2007
IEEE
93views Hardware» more  ACSD 2007»
15 years 9 months ago
SAT-based Unbounded Model Checking of Timed Automata
We present an improvement of the SAT-based Unbounded Model Checking (UMC) algorithm. UMC, a symbolic approach introduced in [7], uses propositional formulas in conjunctive normal ...
Wojciech Penczek, Maciej Szreter
CISIS
2007
IEEE
15 years 8 months ago
Task Decomposition and Delegation Algorithms for Coordinating Unstructured Multi Agent Systems
This paper describes the initial PhD research work for developing an innovative process for agent coordination in unstructured distributed environments. In this proposal, an agent...
António Luis Lopes, Luís Miguel Bote...
COCO
2008
Springer
97views Algorithms» more  COCO 2008»
15 years 8 months ago
Generalized Tsirelson Inequalities, Commuting-Operator Provers, and Multi-prover Interactive Proof Systems
A central question in quantum information theory and computational complexity is how powerful nonlocal strategies are in cooperative games with imperfect information, such as mult...
Tsuyoshi Ito, Hirotada Kobayashi, Daniel Preda, Xi...
COMPGEOM
2008
ACM
15 years 8 months ago
Polychromatic colorings of plane graphs
We show that the vertices of any plane graph in which every face is of length at least g can be colored by (3g - 5)/4 colors so that every color appears in every face. This is nea...
Noga Alon, Robert Berke, Kevin Buchin, Maike Buchi...
COMPGEOM
2008
ACM
15 years 8 months ago
Circular partitions with applications to visualization and embeddings
We introduce a hierarchical partitioning scheme of the Euclidean plane, called circular partitions. Such a partition consists of a hierarchy of convex polygons, each having small ...
Krzysztof Onak, Anastasios Sidiropoulos
« Prev « First page 3037 / 3618 Last » Next »