Sciweavers

1403 search results - page 95 / 281
» On Communication in Solving Distributed Constraint Satisfact...
Sort
View
AISC
2008
Springer
14 years 11 months ago
Strategies for Solving SAT in Grids by Randomized Search
Grid computing offers a promising approach to solving challenging computational problems in an environment consisting of a large number of easily accessible resources. In this pape...
Antti Eero Johannes Hyvärinen, Tommi A. Juntt...
CP
2000
Springer
15 years 2 months ago
Maintaining Arc-Consistency within Dynamic Backtracking
Most of complete search algorithms over Constraint Satisfaction Problems (csp) are based on Standard Backtracking. Two main enhancements of this basic scheme have been proposed : r...
Narendra Jussien, Romuald Debruyne, Patrice Boizum...
CONSTRAINTS
2007
100views more  CONSTRAINTS 2007»
14 years 9 months ago
Design of Financial CDO Squared Transactions Using Constraint Programming
We give an approximate and often extremely fast method of building a particular kind of portfolio in finance, here called a portfolio design (PD), with applications in the credit ...
Pierre Flener, Justin Pearson, Luis G. Reyna, Olof...
ATAL
2006
Springer
15 years 1 months ago
Multiply-constrained distributed constraint optimization
Distributed constraint optimization (DCOP) has emerged as a useful technique for multiagent coordination. While previous DCOP work focuses on optimizing a single team objective, i...
Emma Bowring, Milind Tambe, Makoto Yokoo
ICPP
2000
IEEE
15 years 1 months ago
A Problem-Specific Fault-Tolerance Mechanism for Asynchronous, Distributed Systems
The idle computers on a local area, campus area, or even wide area network represent a significant computational resource--one that is, however, also unreliable, heterogeneous, an...
Adriana Iamnitchi, Ian T. Foster