2095 search results - page 271 / 419 » Improved pebbling bounds |
197
click to vote
ICDCS
2000
IEEE
15 years 10 months ago
2000
IEEE
Providing shared-memory abstraction in messagepassing systems often simplifies the development of distributed algorithms and allows for the reuse of sharedmemory algorithms in the...
178
click to vote
NETWORKING
2010
15 years 8 months ago
2010
Rate-Delay (RD) Network Services constitute a promising differentiated-services architecture for multi-provider networks, by offering users a choice between high throughput or low ...
165
click to vote
COMGEO
2010
ACM
15 years 6 months ago
2010
ACM
We study the complexity and the I/O-efficient computation of flow on triangulated terrains. We present an acyclic graph, the descent graph, that enables us to trace flow paths in ...
218
click to vote
AI
2005
Springer
15 years 6 months ago
2005
Springer
Maximum Boolean satisfiability (max-SAT) is the optimization counterpart of Boolean satisfiability (SAT), in which a variable assignment is sought to satisfy the maximum number of...
195
click to vote
COMBINATORICS
1998
15 years 6 months ago
1998
The aim of this paper is to give a coherent account of the problem of constructing cubic graphs with large girth. There is a well-defined integer µ0(g), the smallest number of v...