185 search results - page 24 / 37 » Solving problems on recursively constructed graphs |
102
click to vote
PPDP
2009
Springer
15 years 6 months ago
2009
Springer
We propose a novel approach to encapsulate non-deterministic computations in functional logic programs. Our approach is based on set functions that return the set of all the resul...
PODC
2005
ACM
15 years 5 months ago
2005
ACM
Many large-scale networks such as ad hoc and sensor networks, peer-to-peer networks, or the Internet have the property that the number of independent nodes does not grow arbitrari...
DAC
2004
ACM
16 years 22 days ago
2004
ACM
Instances of the Boolean satisfiability problem (SAT) arise in many areas of circuit design and verification. These instances are typically constructed from some human-designed ar...
107
click to vote
PPOPP
2005
ACM
15 years 5 months ago
2005
ACM
We want to perform compile-time analysis of an SPMD program and place barriers in it to synchronize it correctly, minimizing the runtime cost of the synchronization. This is the b...
IPPS
2000
IEEE
15 years 4 months ago
2000
IEEE
This paper examines the task of constructing boundedtime self-stabilizing rule-based systems that take their input from an external environment. Bounded response-time and self-sta...