1040 search results - page 174 / 208 » Rounding algorithms for covering problems |
CP
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. This paper deals with the problem of solving efficiently structured CSPs. It is well known that (hyper)tree-decompositions offer the best approaches from a theoretical v...
SAC
2006
ACM
15 years 3 months ago
2006
ACM
Location-based applications and services are getting increasingly important for mobile users. They take into account a mobile user's current location and provide a location-d...
91
Voted
VLSID
2005
IEEE
15 years 3 months ago
2005
IEEE
During pseudorandom testing, a significant amount of energy and test application time is wasted for generating and for applying “useless” test vectors that do not contribute t...
73
Voted
COCOON
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. We investigate the online exploration problem of a shortsighted mobile robot moving in an unknown cellular room without obstacles. The robot has a very limited sensor; it...
CASES
2010
ACM
14 years 7 months ago
2010
ACM
Common generated instruction selections are based on tree pattern matching, but modern and custom architectures feature instructions, which cannot be covered by trees. To overcome...