4565 search results - page 714 / 913 » Time Optimal Self-Stabilizing Algorithms |
95
Voted
CGF
2008
15 years 23 days ago
2008
We describe algorithms for canonically partitioning semi-regular quadrilateral meshes into structured submeshes, using an adaptation of the geometric motorcycle graph of Eppstein ...
87
Voted
IEICET
2006
15 years 19 days ago
2006
A problem of arranging n points as uniformly as possible, which is equivalent to that of packing n equal and non-overlapping circles in a unit square, is frequently asked. In this ...
DAM
1999
15 years 9 days ago
1999
It is well known that on a line, a target point in unknown position can be found by walking a path at most 9 times as long as the distance from the start to the target point, in t...
137
click to vote
TIP
2002
15 years 8 days ago
2002
Fractal image encoding is a computationally intensive method of compression due to its need to find the best match between image sub-blocks by repeatedly searching a large virtual...
90
Voted
ATAL
2007
Springer
15 years 6 months ago
2007
Springer
This paper analyzes bilateral multi-issue negotiation between selfinterested autonomous agents. The agents have time constraints in the form of both deadlines and discount factors...