Sciweavers

167 search results - page 14 / 34
» A Genetic Local Search Algorithm for Random Binary Constrain...
Sort
View
ATAL
2003
Springer
14 years 24 days ago
A multiagent-system for integrating a large-scale project
This paper presents a multiagent-system for integrating ALICE: a real-life, distributed, large-scale particle physics experiment of the LHC project at CERN. The work is concerned ...
Carlos Eisenberg, Boi Faltings, Lars Leistam
IJCAI
2001
13 years 9 months ago
Balance and Filtering in Structured Satisfiable Problems
New methods to generate hard random problem instances have driven progress on algorithms for deduction and constraint satisfaction. Recently Achlioptas et al. (AAAI 2000) introduc...
Henry A. Kautz, Yongshao Ruan, Dimitris Achlioptas...
SGAI
2007
Springer
14 years 1 months ago
Escaping Local Optima: Constraint Weights vs. Value Penalties
Constraint Satisfaction Problems can be solved using either iterative improvement or constructive search approaches. Iterative improvement techniques converge quicker than the cons...
Muhammed Basharu, Inés Arana, Hatem Ahriz
FOGA
2011
12 years 11 months ago
Computational complexity analysis of simple genetic programming on two problems modeling isolated program semantics
Analyzing the computational complexity of evolutionary algorithms (EAs) for binary search spaces has significantly informed our understanding of EAs in general. With this paper, ...
Greg Durrett, Frank Neumann, Una-May O'Reilly
SAC
2006
ACM
13 years 7 months ago
Efficient interactive configuration of unbounded modular systems
Interactive configuration guides a user searching through a large combinatorial space of solutions to a system of constraints. We investigate a class of very expressive underlying...
Erik Roland van der Meer, Andrzej Wasowski, Henrik...