Sciweavers

858 search results - page 157 / 172
» A Glimpse of Constraint Satisfaction
Sort
View
HICSS
1994
IEEE
149views Biometrics» more  HICSS 1994»
13 years 11 months ago
Stochastic Problem Solving by Local Computation Based on Self-Organization Paradigm
We are developing a new problem-solving methodology based on a self-organization paradigm. To realize our future goal of self-organizing computational systems, we have to study co...
Yasusi Kanada, Masao Hirokawa
EVOW
2010
Springer
13 years 11 months ago
Ant Colony Optimization for Tree Decompositions
Instances of constraint satisfaction problems can be solved efficiently if they are representable as a tree decomposition of small width. Unfortunately, the task of finding a deco...
Thomas Hammerl, Nysret Musliu
CEC
2007
IEEE
13 years 11 months ago
Solving, rating and generating Sudoku puzzles with GA
This paper studies the problems involved in solving, rating and generating Sudoku puzzles with genetic algorithms (GA). Sudoku is a number puzzle that has recently become a worldwi...
Timo Mantere, Janne Koljonen
GECCO
2007
Springer
168views Optimization» more  GECCO 2007»
13 years 11 months ago
Evolutionary design of single-mode microstructured polymer optical fibres using an artificial embryogeny representation
Polymer microstructured optical fibres are a relatively recent development in optical fibre technology, supporting a wide variety of microstructure fibre geometries, when compared...
Steven Manos, Maryanne Large, Leon Poladian
CP
2004
Springer
13 years 11 months ago
Concurrent Dynamic Backtracking for Distributed CSPs
A distributed concurrent search algorithm for distributed constraint satisfaction problems (DisCSPs) is presented. Concurrent search algorithms are composed of multiple search proc...
Roie Zivan, Amnon Meisels