297 search results - page 39 / 60 » Towards a Parallel Search for Solutions of Non-deterministic... |
IPPS
1999
IEEE
15 years 1 months ago
1999
IEEE
Instance based locality optimization 6 is a semi automatic program restructuring method that reduces the number of cache misses. The method imitates the human approach of consideri...
102
click to vote
CLUSTER
2008
IEEE
15 years 4 months ago
2008
IEEE
—We consider the problem of efficiently managing massive data in a large-scale distributed environment. We consider data strings of size in the order of Terabytes, shared and ac...
IPPS
2006
IEEE
15 years 3 months ago
2006
IEEE
We present a SAT-based approach to the task and message allocation problem of distributed real-time systems with hierarchical architectures. In contrast to the heuristic approache...
101
click to vote
ICDCS
2000
IEEE
15 years 2 months ago
2000
IEEE
We present resolvent-based learning as a new nogood learning method for a distributed constraint satisfaction algorithm. This method is based on a look-back technique in constrain...
140
click to vote
PODC
2011
ACM
14 years 14 days ago
2011
ACM
A maximal independent set on a graph is an inclusion-maximal set of mutually non-adjacent nodes. This basic symmetry breaking structure is vital for many distributed algorithms, w...