42230 search results - page 393 / 8446 » Algorithms and Complexity Results for |
208
click to vote
OPODIS
2008
15 years 9 months ago
2008
We consider wait-free implementations of a regular read/ write register for unauthenticated data using a collection of 3t + k base objects, t of which can be subject to Byzantine ...
241
click to vote
ALGORITHMICA
2008
15 years 7 months ago
2008
The profile of a graph is an integer-valued parameter defined via vertex orderings; it is known that the profile of a graph equals the smallest number of edges of an interval supe...
189
click to vote
ECOOP
2005
Springer
16 years 1 months ago
2005
Springer
There are many algorithms for concurrent garbage collection, but they are complex to describe, verify, and implement. This has resulted in a poor understanding of the relationships...
205
click to vote
GD
2005
Springer
16 years 1 months ago
2005
Springer
This paper presents a new framework for drawing graphs in three dimensions. In general, the new framework uses a divide and conquer approach. More specifically, the framework divi...
267
click to vote
AAAI
2004
15 years 9 months ago
2004
In this paper, we present a general technique for taking forward-chaining planners for deterministic domains (e.g., HSP, TLPlan, TALplanner, and SHOP2) and adapting them to work i...