Sciweavers

1264 search results - page 58 / 253
» The framework approach for constraint satisfaction
Sort
View
CSCLP
2006
Springer
15 years 9 months ago
An Attempt to Dynamically Break Symmetries in the Social Golfers Problem
A number of different satisfaction and optimisation combinatorial problems have recently been approached with constraint programming over the domain of finite sets, for increased d...
Francisco Azevedo
GECCO
2008
Springer
145views Optimization» more  GECCO 2008»
15 years 7 months ago
An evolutionary approach for competency-based curriculum sequencing
The process of creating e-learning contents using reusable learning objects (LOs) can be broken down in two sub-processes: LOs finding and LO sequencing. Sequencing is usually per...
Luis de Marcos, José-Javier Martínez...
SETN
2004
Springer
15 years 11 months ago
Construction and Repair: A Hybrid Approach to Search in CSPs
Abstract. In order to obtain a solution to a constraint satisfaction problem, constructive methods iteratively extend a consistent partial assignment until all problem variables ar...
Konstantinos Chatzikokolakis, George Boukeas, Pana...
AAAI
2000
15 years 7 months ago
RealPlan: Decoupling Causal and Resource Reasoning in Planning
Recent work has demonstrated that treating resource reasoning separately from causal reasoning can lead to improved planning performance and rational resource management where inc...
Biplav Srivastava
AUTOMATICA
2007
102views more  AUTOMATICA 2007»
15 years 6 months ago
An extension of duality to a game-theoretic framework
This paper extends some duality results from a standard optimization setup to a noncooperative (Nash) game framework. A Nash game (NG) with coupled constraints is considered. Solv...
Lacra Pavel