1671 search results - page 305 / 335 » On the Covering Steiner Problem |
HT
2007
ACM
14 years 2 months ago
2007
ACM
The design and maintenance of an aero-engine generates a significant amount of documentation. When designing new engines, engineers must obtain knowledge gained from maintenance o...
ATC
2006
Springer
14 years 2 months ago
2006
Springer
In recent years, a variety of new computing paradigms have been proposed for various purposes. It is true that many of them intend to and really can gratify some of the people some...
AIPS
2010
14 years 1 months ago
2010
Heuristic functions make MDP solvers practical by reducing their time and memory requirements. Some of the most effective heuristics (e.g., the FF heuristic function) first determ...
ATAL
2008
Springer
14 years 29 days ago
2008
Springer
The exploration problem is a central issue in mobile robotics. A complete terrain coverage is not practical if the environment is large with only a few small hotspots. This paper ...
CIKM
2008
Springer
14 years 28 days ago
2008
Springer
In the past, quite a few fast algorithms have been developed to mine frequent patterns over graph data, with the large spectrum covering many variants of the problem. However, the...