Sciweavers

7092 search results - page 220 / 1419
» Parallelizing constraint programs
Sort
View
76
Voted
CP
2003
Springer
15 years 5 months ago
Propagation Redundancy in Redundant Modelling
Combining mutually redundant models with channelling constraints increases constraint propagation. However, the extra computation efforts of the additional variables and constraint...
Chiu Wo Choi, Jimmy Ho-Man Lee, Peter J. Stuckey
NETWORKS
2008
15 years 14 days ago
Reformulation and sampling to solve a stochastic network interdiction problem
The Network Interdiction Problem involves interrupting an adversary's ability to maximize flow through a capacitated network by destroying portions of the network. A budget c...
Udom Janjarassuk, Jeff Linderoth
96
Voted
TSP
2008
107views more  TSP 2008»
15 years 12 days ago
Opportunistic Spectrum Access via Periodic Channel Sensing
The problem of opportunistic access of parallel channels occupied by primary users is considered. Under a continuous-time Markov chain modeling of the channel occupancy by the prim...
Qing Zhao, Stefan Geirhofer, Lang Tong, Brian M. S...
93
Voted
CG
2008
Springer
15 years 2 months ago
Parallel Monte-Carlo Tree Search
Monte-Carlo Tree Search (MCTS) is a new best-first search method that started a revolution in the field of Computer Go. Parallelizing MCTS is an important way to increase the stren...
Guillaume Chaslot, Mark H. M. Winands, H. Jaap van...
96
Voted
SARA
2007
Springer
15 years 6 months ago
Tailoring Solver-Independent Constraint Models: A Case Study with Essence' and Minion
In order to apply constraint programming to a particular domain, the problem must first be modelled as a constraint satisfaction problem. There are typically many alternative mode...
Ian P. Gent, Ian Miguel, Andrea Rendl