1566 search results - page 162 / 314 » On a Cone Covering Problem |
101
click to vote
FOSSACS
2010
Springer
15 years 11 months ago
2010
Springer
Depth-bounded processes form the most expressive known fragment of the π-calculus for which interesting verification problems are still decidable. In this paper we develop an ade...
142
click to vote
EDBT
2009
ACM
15 years 11 months ago
2009
ACM
Keyword search has been recently extended to relational databases to retrieve information from text-rich attributes. However, all the existing methods focus on finding individual...
140
click to vote
CPAIOR
2009
Springer
15 years 11 months ago
2009
Springer
Context-free grammar constraints enforce that a sequence of variables forms a word in a language defined by a context-free grammar. The constraint has received a lot of attention ...
133
click to vote
CEC
2008
IEEE
15 years 11 months ago
2008
IEEE
— The problem of robotic area coverage is applicable to many domains, such as search, agriculture, cleaning, and machine tooling. The robotic area coverage task is concerned with...
120
click to vote
ICDCSW
2008
IEEE
15 years 11 months ago
2008
IEEE
In this paper, we propose a new control method to cover the “holes” in wireless sensor networks. Many applications often face the problem of holes when some sensor nodes are d...