1403 search results - page 63 / 281 » On Communication in Solving Distributed Constraint Satisfact... |
138
click to vote
SIGMOD
2007
ACM
15 years 10 months ago
2007
ACM
We show that aggregate constraints (as opposed to pairwise constraints) that often arise when integrating multiple sources of data, can be leveraged to enhance the quality of dedu...
EUROSYS
2006
ACM
15 years 6 months ago
2006
ACM
Run-time conflicts can affect even the most rigorously tested software systems. A reliance on execution-based testing makes it prohibitively costly to test every possible interac...
ICDCS
1999
IEEE
15 years 2 months ago
1999
IEEE
Existing workflow management systems encapsulate the data and behavior of a process within its execution scope, preventing other processes from accessing this information until th...
LPAR
2010
Springer
14 years 8 months ago
2010
Springer
Abstract. In this paper we study the problem of solving hard propositional satisfiability problem (SAT) instances in a computing grid or cloud, where run times and communication b...
APIN
2005
14 years 9 months ago
2005
A hybrid Neural-Genetic algorithm (NG) is presented for the frequency assignment problem in satellite communications (FAPSC). The goal of this problem is minimizing the cochannel i...