Sciweavers

482 search results - page 38 / 97
» Modelling Search Strategies in Rules2CP
Sort
View
CP
2005
Springer
14 years 1 months ago
Encoding HTN Planning as a Dynamic CSP
Abstract. Constraint satisfaction problems provide strong formalism for modeling variety of real life problems. This paper presents a work currently in progress of which the goal i...
Pavel Surynek, Roman Barták
GECCO
2009
Springer
141views Optimization» more  GECCO 2009»
14 years 10 days ago
Benchmarking the NEWUOA on the BBOB-2009 function testbed
The NEWUOA which belongs to the class of Derivative-Free optimization algorithms is benchmarked on the BBOB-2009 noisefree testbed. A multistart strategy is applied with a maximum...
Raymond Ros
CORR
2002
Springer
96views Education» more  CORR 2002»
13 years 7 months ago
The Sketch of a Polymorphic Symphony
In previous work, we have introduced functional strategies, that is, first-class generic functions that can traverse into terms of any type while mixing uniform and type-specific ...
Ralf Lämmel
CP
2007
Springer
13 years 11 months ago
Exploring Different Constraint-Based Modelings for Program Verification
Recently, constraint-programming techniques have been used to generate test data and to verify the conformity of a program with its specification. Constraint generated for these ta...
Hélène Collavizza, Michel Rueher
CSCLP
2008
Springer
13 years 9 months ago
IDB-ADOPT: A Depth-First Search DCOP Algorithm
Abstract. Many agent coordination problems can be modeled as distributed constraint optimization problems (DCOPs). ADOPT is an asynchronous and distributed search algorithm that is...
William Yeoh, Ariel Felner, Sven Koenig