930 search results - page 116 / 186 » Color Differential Structure |
AAAI
1998
15 years 3 months ago
1998
The typical difficulty of various NP-hard problems varies with simple parameters describing their structure. This behavior is largely independent of the search algorithm, but depe...
117
click to vote
CORR
2007
Springer
15 years 2 months ago
2007
Springer
Abstract. We describe decomposition during search (DDS), an integration of And/Or tree search into propagation-based constraint solvers. The presented search algorithm dynamically ...
116
Voted
RSA
2011
14 years 9 months ago
2011
Determining the cardinality and describing the structure of H-free graphs is wellinvestigated for many graphs H. In the nineties, Prömel and Steger proved that for a graph H with...
106
Voted
CORR
2010
Springer
15 years 2 months ago
2010
Springer
Natural networks such as those between humans observed through their interactions or biological networks predicted based on various experimental measurements contain a wealth of i...
102
click to vote
AFRIGRAPH
2006
ACM
15 years 8 months ago
2006
ACM
Volume data is usually generated by measuring devices (eg. CT scanners, MRI scanners), mathematical functions (eg., Marschner/Lobb function), or by simulations. While all these so...