569 search results - page 33 / 114 » An Empirical Study of Structural Constraint Solving Techniqu... |
MATES
2009
Springer
14 years 1 months ago
2009
Springer
In constraint satisfaction, decomposition is a common technique to split a problem in a number of parts in such a way that the global solution can be efficiently assembled from th...
CONSTRAINTS
2008
13 years 7 months ago
2008
Aligning DNA and protein sequences is a core technique in molecular biology. Often, it is desirable to include partial prior knowledge and conditions in an alignment. Going beyond...
ML
2006
ACM
13 years 7 months ago
2006
ACM
We present a new algorithm for Bayesian network structure learning, called Max-Min Hill-Climbing (MMHC). The algorithm combines ideas from local learning, constraint-based, and sea...
COMPULOG
1999
Springer
13 years 11 months ago
1999
Springer
Planning and scheduling attracts an unceasing attention of computer science community. However, despite of similar character of both tasks, in most current systems planning and sch...
AUSAI
2008
Springer
13 years 9 months ago
2008
Springer
Planning collision-free paths for multiple robots traversing a shared space is a problem that grows combinatorially with the number of robots. The naive centralised approach soon ...