313 search results - page 16 / 63 » Complete Local Search with Memory |
145
Voted
AIMSA
2008
Springer
15 years 4 months ago
2008
Springer
We present a hybrid approach to Distributed Constraint Satisfaction which combines incomplete, fast, penalty-based local search with complete, slower systematic search. Thus, we pr...
111
click to vote
SAT
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. This paper shows that idempotents in finite rings of integers can act as Generalized Boolean Assignments (GBA’s) by providing a completeness theorem. We introduce the ...
99
Voted
CPE
1997
Springer
15 years 6 months ago
1997
Springer
We consider the problem of storing and searching a large state space obtained from a high-level model such as a queueing network or a Petri net. After reviewing the traditional te...
136
Voted
FTTCS
2006
15 years 2 months ago
2006
Data sets in large applications are often too massive to fit completely inside the computer's internal memory. The resulting input/output communication (or I/O) between fast ...
144
Voted
IPPS
2010
IEEE
14 years 11 months ago
2010
IEEE
We present a novel architecture of a communication engine for non-coherent distributed shared memory systems. The shared memory is composed by a set of nodes exporting their memory...