Sciweavers

2109 search results - page 36 / 422
» Solving Necklace Constraint Problems
Sort
View
SAS
2001
Springer
15 years 8 months ago
Solving Regular Tree Grammar Based Constraints
This paper describes the precise speci cation, design, analysis, implementation, and measurements of an e cient algorithm for solving regular tree grammar based constraints. The p...
Yanhong A. Liu, Ning Li, Scott D. Stoller
CEC
2007
IEEE
15 years 10 months ago
An investigation into dynamic problem solving in a hybrid evolutionary market-based multi-agent system
— Static resources allocation problems have been widely studied. More recently some of this attention has changed to focus on dynamic problems, where problem specifications, con...
D. J. Cornforth
WSC
2007
15 years 6 months ago
Stochastic rollout and justification to solve the resource-constrained project scheduling problem
The key question addressed by the resource-constrained project scheduling problem (RCPSP) is to determine the start times for each activity such that precedence and resource const...
Ningxiong Xu, Linda K. Nozick, Orr Bernstein, Dean...
DAM
2000
137views more  DAM 2000»
15 years 4 months ago
Solving the feedback vertex set problem on undirected graphs
Feedback problems consist of removing a minimal number of vertices of a directed or undirected graph in order to make it acyclic. The problem is known to be NPcomplete. In this pa...
Lorenzo Brunetta, Francesco Maffioli, Marco Trubia...
CP
2003
Springer
15 years 9 months ago
Solving Finite Domain Constraint Hierarchies by Local Consistency and Tree Search
We provide a reformulation of the constraint hierarchies (CHs) framework based on the notion of error indicators. Adapting the generalized view of local consistency in semiring-ba...
Stefano Bistarelli, Philippe Codognet, Kin Chuen H...