97 search results - page 13 / 20 » Local Strategy Improvement for Parity Game Solving |
IWINAC
2007
Springer
15 years 4 months ago
2007
Springer
We consider the problem of designing error correcting codes (ECC), a hard combinatorial optimization problem of relevance in the field of telecommunications. This problem is firs...
SIAMCO
2010
14 years 8 months ago
2010
We consider linear-quadratic-Gaussian (LQG) games with a major player and a large number of minor players. The major player has a significant influence on others. The minor playe...
CP
2005
Springer
15 years 3 months ago
2005
Springer
Classical methods for solving numerical CSPs are based on a branch and prune algorithm, a dichotomic enumeration process interleaved with a consistency filtering algorithm. In man...
70
Voted
NPL
2000
14 years 10 months ago
2000
In standard neuro-evolution, a population of networks is evolved in a task, and the network that best solves the task is found. This network is then fixed and used to solve future...
ECCV
2008
Springer
16 years 1 min ago
2008
Springer
Sliding window classifiers are among the most successful and widely applied techniques for object localization. However, training is typically done in a way that is not specific to...