4451 search results - page 167 / 891 » On Random Ordering Constraints |
137
click to vote
AI
2002
Springer
15 years 4 months ago
2002
Springer
This paper presents a multi-agent oriented method for solving CSPs (Constraint Satisfaction Problems). In this method, distributed agents represent variables and a two-dimensional...
187
click to vote
JMLR
2008
15 years 4 months ago
2008
Log-linear and maximum-margin models are two commonly-used methods in supervised machine learning, and are frequently used in structured prediction problems. Efficient learning of...
122
click to vote
CP
2005
Springer
15 years 10 months ago
2005
Springer
Abstract Competition and cooperation can boost the performance of a combinatorial search process. Both can be implemented with a portfolio of algorithms which run in parallel, give...
127
click to vote
GW
2005
Springer
15 years 10 months ago
2005
Springer
Simulating realistic human-like figures is still a challenging task when dynamics is involved. For example, making a virtual human jump to a given position requires to control the...
173
Voted
AMAI
2004
Springer
15 years 10 months ago
2004
Springer
This paper presents new look-ahead schemes for backtracking search when solving constraint satisfaction problems. The look-ahead schemes compute a heuristic for value ordering and...