4255 search results - page 48 / 851 » Cover |
ANTSW
2006
Springer
14 years 1 months ago
2006
Springer
We present an algorithm for covering continuous domains by primitive robots whose only ability is to mark visited places with pheromone and to sense the level of the pheromone in t...
FMCAD
2006
Springer
14 years 1 months ago
2006
Springer
In this paper, a new heuristic-based approach is introduced to extract minimally unsatisfiable subformulas (in short, MUSes) of SAT instances. It is shown that it often outperforms...
MVA
2007
13 years 11 months ago
2007
In this paper a new approach to finding and tracking various land cover boundaries such as rivers, agricultural fields, channels and roads for use in visual navigation system of a...
STRINGOLOGY
2008
13 years 11 months ago
2008
Abstract. We study the problem of finding local and global covers as well as seeds in conservative indeterminate strings. An indeterminate string is a sequence T = T[1]T[2] . . . T...
CDES
2006
13 years 11 months ago
2006
- Most of the direct-cover Boolean minimization techniques use a four step cyclic algorithm. First, the algorithm chooses an On-minterm; second, it generates the set of prime impli...