5263 search results - page 326 / 1053 » Open Constraint Optimization |
136
click to vote
IJCAI
2007
15 years 6 months ago
2007
Caching, symmetries, and search with decomposition are powerful techniques for pruning the search space of constraint problems. In this paper we present an innovative way of effi...
147
click to vote
UAI
2008
15 years 6 months ago
2008
Approximate linear programming (ALP) is an efficient approach to solving large factored Markov decision processes (MDPs). The main idea of the method is to approximate the optimal...
145
click to vote
CONCURRENCY
2000
15 years 4 months ago
2000
The Java memory model described in Chapter 17 of the Java Language Specification gives constraints on how threads interact through memory. This chapter is hard to interpret and po...
119
Voted
GEOINFORMATICA
2002
15 years 4 months ago
2002
Manual cartographic generalization is a simultaneous process. However, most automatic approaches so far have been sequential; generalization operators are applied one at a time in...
125
click to vote
CORR
2011
Springer
15 years 2 days ago
2011
Springer
In an implicit combinatorial optimization problem, the constraints are not enumerated explicitly but rather stated implicitly through equations, other constraints or auxiliary alg...