14 search results - page 3 / 3 » Graph Coloring Algorithms for Fast Evaluation of Curtis Deco... |
COCOON
2009
Springer
13 years 11 months ago
2009
Springer
In this paper, we deal with restoring missing information in molecule databases: Some data formats only store the atoms’ configuration but omit bond multiplicities. As this info...
PDPTA
2000
13 years 6 months ago
2000
Exploiting compile time knowledge to improve memory bandwidth can produce noticeable improvements at run-time [13, 1]. Allocating the data structure [13] to separate memories when...
JAIR
2006
13 years 5 months ago
2006
Fast Downward is a classical planning system based on heuristic search. It can deal with general deterministic planning problems encoded in the propositional fragment of PDDL2.2, ...
MOBIHOC
2006
ACM
13 years 11 months ago
2006
ACM
A large number of practical sensing and actuating applications require immediate notification of rare but urgent events and also fast delivery of time sensitive actuation command...