1461 search results - page 183 / 293 » Complexity of Graph Covering Problems |
CDC
2010
IEEE
13 years 4 months ago
2010
IEEE
This work considers the problem of designing optimal multi-agent trajectories to patrol an environment. As performance criterion for optimal patrolling we consider the worst-case t...
FSTTCS
2008
Springer
13 years 10 months ago
2008
Springer
We survey determinacy, definability, and complexity issues of Banach-Mazur games on finite and infinite graphs. Infinite games where two players take turns to move a token thro...
STOC
2003
ACM
14 years 9 months ago
2003
ACM
We describe a simple randomized construction for generating pairs of hash functions h1, h2 from a universe U to ranges V = [m] = {0, 1, . . . , m - 1} and W = [m] so that for ever...
ICCAD
1999
IEEE
14 years 1 months ago
1999
IEEE
In this paper we present new methods for fast justification and propagation in the implication graph (IG) which is the core data structure of our SAT based implication engine. As ...
RECOMB
2005
Springer
14 years 9 months ago
2005
Springer
Abstract. We introduce an extended computational framework for studying biological systems. Our approach combines formalization of existing qualitative models that are in wide but ...