7 search results - page 1 / 2 » Locally Informed Global Search for Sums of Combinatorial Gam... |
CG
2004
Springer
13 years 8 months ago
2004
Springer
Abstract. There are two complementary approaches to playing sums of combinatorial games. They can be characterized as local analysis and global search. Algorithms from combinatoria...
IDA
2003
Springer
13 years 10 months ago
2003
Springer
Abstract. Since minimum sum-of-squares clustering (MSSC) is an NPhard combinatorial optimization problem, applying techniques from global optimization appears to be promising for r...
CORR
2011
Springer
12 years 11 months ago
2011
Springer
good solutions to complex problems. In many examples, individuals trying to solve superior global solution. This suggests that there may be general principles of information aggre...
ICDM
2008
IEEE
13 years 11 months ago
2008
IEEE
This paper presents a data oriented approach to modeling the complex computing systems, in which an ensemble of correlation models are discovered to represent the system status. I...
NIPS
1993
13 years 6 months ago
1993
Dynamic programming provides a methodology to develop planners and controllers for nonlinear systems. However, general dynamic programming is computationally intractable. We have ...