Sciweavers

990 search results - page 27 / 198
» Using evolution strategies to solve DEC-POMDP problems
Sort
View
GECCO
2008
Springer
143views Optimization» more  GECCO 2008»
13 years 9 months ago
Application domain study of evolutionary algorithms in optimization problems
This paper deals with the problem of comparing and testing evolutionary algorithms, that is, the benchmarking problem, from an analysis point of view. A practical study of the app...
Pilar Caamaño, Francisco Bellas, José...
IADIS
2003
13 years 9 months ago
Information Management and Interoperability Strategies: The Case for Digital Identifiers
The move from the current compartmentalised systems into an interoperable environment is the central challenge facing digital development this decade. In the quest for a semantic ...
Robin Wilson
CP
2010
Springer
13 years 6 months ago
Towards Parallel Non Serial Dynamic Programming for Solving Hard Weighted CSP
We introduce a parallelized version of tree-decomposition based dynamic programming for solving difficult weighted CSP instances on many cores. A tree decomposition organizes cost ...
David Allouche, Simon de Givry, Thomas Schiex
CEC
2008
IEEE
14 years 2 months ago
Solving large scale global optimization using improved Particle Swarm Optimizer
—As more and more real-world optimization problems become increasingly complex, algorithms with more capable optimizations are also increasing in demand. For solving large scale ...
Sheng-Ta Hsieh, Tsung-Ying Sun, Chan-Cheng Liu, Sh...
ICCAD
1997
IEEE
108views Hardware» more  ICCAD 1997»
14 years 6 days ago
Negative thinking by incremental problem solving: application to unate covering
We introduce a new technique to solve exactly a discrete optimization problem, based on the paradigm of “negative” thinking. The motivation is that when searching the space of...
Evguenii I. Goldberg, Luca P. Carloni, Tiziano Vil...