Sciweavers

428 search results - page 33 / 86
» An asynchronous complete method for distributed constraint o...
Sort
View
PROCEDIA
2011
14 years 6 months ago
Exact Closest String as a Constraint Satisfaction Problem
We report the first evaluation of Constraint Satisfaction as a computational framework for solving closest string problems. We show that careful consideration of symbol occurrenc...
Tom Kelsey, Lars Kotthoff
WSC
2008
15 years 5 months ago
Simulation-based, optimized scheduling of limited bar-benders over multiple building sites
In the construction industry, a specialist subcontractor manages a taskforce of single-skilled laborers to work on multiple construction sites, aiming to minimize the total cost a...
Hoi-Ching Lam, Ming Lu
122
Voted
AAAI
2008
15 years 5 months ago
H-DPOP: Using Hard Constraints for Search Space Pruning in DCOP
In distributed constraint optimization problems, dynamic programming methods have been recently proposed (e.g. DPOP). In dynamic programming many valuations are grouped together i...
Akshat Kumar, Adrian Petcu, Boi Faltings
112
Voted
EOR
2006
78views more  EOR 2006»
15 years 3 months ago
A multi-objective resource allocation problem in PERT networks
We develop a multi-objective model for resource allocation problem in PERT networks with exponentially or Erlang distributed activity durations, where the mean duration of each ac...
Amir Azaron, Hideki Katagiri, Masatoshi Sakawa, Ko...
IPPS
1999
IEEE
15 years 7 months ago
A Formal Framework for Specifying and Verifying Time Warp Optimizations
Parallel and distributed systems are representative of large and complex systems that require the application of formal methods. These systems are often unreliable because implemen...
Victoria Chernyakhovsky, Peter Frey, Radharamanan ...