284 search results - page 20 / 57 » On Some Polyhedra Covering Problems |
IJWIN
2006
13 years 8 months ago
2006
Abstract-- We consider a wireless sensor network consisting of a set of sensors deployed randomly. A point in the monitored area is covered if it is within the sensing range of a s...
TAMC
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. Kernelizations are an important tool in designing fixed parameter algorithms for parameterized decision problems. We introduce an analogous notion for counting problems,...
FOSSACS
2009
Springer
14 years 3 months ago
2009
Springer
In this essay we discuss the origin, central results, and some perspectives of algorithmic synthesis of nonterminating reactive programs. We recall the fundamental questions raised...
TPHOL
2003
IEEE
14 years 2 months ago
2003
IEEE
Coverage checking is the problem of deciding whether any closed term of a given type is an instance of at least one of a given set of patterns. It can be used to verify if a functi...
AGENTS
2001
Springer
14 years 1 months ago
2001
Springer
In this paper, we study a simple means for coordinating teams of simple agents. In particular, we study ant robots and how they can cover terrain once or repeatedly by leaving mar...