6894 search results - page 303 / 1379 » Generation Problems |
184
click to vote
CP
2003
Springer
15 years 12 months ago
2003
Springer
Abstract. Local search algorithms have been very successful for solving constraint satisfaction problems (CSP). However, a major weakness has been that local search is unable to de...
188
click to vote
AAI
2005
15 years 6 months ago
2005
The application of AI planning techniques to manufacturing systems is being widely deployed for all the tasks involved in the process, from product design to production planning an...
146
click to vote
PPSN
1998
Springer
15 years 11 months ago
1998
Springer
Abstract. In order to escape from local optima, it is standard practice to periodically restart a genetic algorithm according to some restart criteria/policy. This paper addresses ...
172
click to vote
UAI
1997
15 years 8 months ago
1997
Robust Bayesian inference is the calculation of posterior probability bounds given perturbations in a probabilistic model. This paper focuses on perturbations that can be expresse...
174
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
Abstract-- Recent work has suggested that low-density generator matrix (LDGM) codes are likely to be effective for lossy source coding problems. We derive rigorous upper bounds on ...