466 search results - page 85 / 94 » Preprocessing Search Spaces for Branch and Bound Search |
126
click to vote
SAC
2006
ACM
14 years 11 months ago
2006
ACM
Interactive configuration guides a user searching through a large combinatorial space of solutions to a system of constraints. We investigate a class of very expressive underlying...
SDM
2009
SIAM
15 years 8 months ago
2009
SIAM
Graph classification is an increasingly important step in numerous application domains, such as function prediction of molecules and proteins, computerised scene analysis, and an...
95
Voted
EDBT
2009
ACM
15 years 6 months ago
2009
ACM
To our best knowledge, all existing graph pattern mining algorithms can only mine either closed, maximal or the complete set of frequent subgraphs instead of graph generators whic...
81
Voted
IJCAI
1989
15 years 25 days ago
1989
This paper deals with a well known problem in AI planning: detecting and resolving conflicts in nonlinear plans. We sketch a theory of restricted conflict detection and resolution...
117
click to vote
AIPS
2010
15 years 24 days ago
2010
Efficient management and propagation of temporal constraints is important for temporal planning as well as for scheduling. During plan development, new events and temporal constra...