Sciweavers

566 search results - page 25 / 114
» Solution Reuse in Dynamic Constraint Satisfaction Problems
Sort
View
CP
1995
Springer
15 years 4 months ago
Optimization-based Heuristics for Maximal Constraint Satisfaction
We present a new heuristic approach for maximal constraint satisfaction of overconstrained problems (MAX-CSP). This approach is based on a formulation of CSP as an optimization pro...
Javier Larrosa, Pedro Meseguer
EVOW
2006
Springer
15 years 4 months ago
A Memetic Algorithm with Bucket Elimination for the Still Life Problem
Abstract. Bucket elimination (BE) is an exact technique based on variable elimination, commonly used for solving constraint satisfaction problems. We consider the hybridization of ...
José E. Gallardo, Carlos Cotta, Antonio J. ...
CP
2006
Springer
15 years 4 months ago
Constraint Satisfaction with Bounded Treewidth Revisited
Abstract. The constraint satisfaction problem can be solved in polynomial time for instances where certain parameters (e.g., the treewidth of primal graphs) are bounded. However, t...
Marko Samer, Stefan Szeider
HT
2009
ACM
15 years 3 months ago
Dynamic hypertext generation for reusing open corpus content
Adaptive hypermedia systems traditionally focus on providing personalised learning services for formal or informal learners. The learning material is typically sourced from a prop...
Ben Steichen, Séamus Lawless, Alexander O'C...
FLAIRS
2001
15 years 1 months ago
On the Technological, Human, and Managerial Issues in Sharing Organizational Lessons
Lessons learned systems (LLS) are systems that support a lessons learned process (LLP) to collect, verify, store, disseminate, and reuse organizational lessons. In this paper we e...
Rosina Weber, Len Breslow, Nabil Sandhu