2924 search results - page 158 / 585 » Lower Bounds in Distributed Computing |
120
click to vote
CIAC
2010
Springer
16 years 13 days ago
2010
Springer
Abstract. Given a binary dominance relation on a set of alternatives, a common thread in the social sciences is to identify subsets of alternatives that satisfy certain notions of ...
111
click to vote
WSC
2007
15 years 5 months ago
2007
The HLA time management is an important factor that limits the scalability of distributed simulations. An efficient algorithm of Greatest Available Logical Time (GALT) is thus muc...
131
click to vote
CGF
1998
15 years 2 months ago
1998
This paper presents a complete algorithm for the evaluation and control of error in radiosity calculations. Providing such control is both extremely important for industrial appli...
140
click to vote
COMPGEOM
2006
ACM
15 years 5 months ago
2006
ACM
We present upper and lower bounds for the number of iterations performed by the Iterative Closest Point (ICP) algorithm. This algorithm has been proposed by Besl and McKay [4] as ...
127
click to vote
AHSWN
2010
15 years 3 months ago
2010
The specific challenges of multihop wireles networks lead to a strong research effort on efficient protocols design where the offered capacity is a key objective. More specifically...