2924 search results - page 138 / 585 » Lower Bounds in Distributed Computing |
160
Voted
COMPSAC
2004
IEEE
15 years 4 months ago
2004
IEEE
Web services (WS) received significant attention recently because services can be searched, bound, and executed at runtime over the Internet. This paper proposes a dynamic reconfi...
97
Voted
PODC
2010
ACM
14 years 11 months ago
2010
ACM
In this paper, we introduce the problem of Continuous Gossip in which rumors are continually and dynamically injected throughout the network. Each rumor has a deadline, and the go...
83
Voted
ALENEX
2007
15 years 2 months ago
2007
We propose heuristics for visibility coverage of a polygon with the fewest point guards. This optimal coverage problem, often called the “art gallery problem”, is known to be ...
112
Voted
AUTOMATICA
2004
15 years 17 days ago
2004
This paper deals with feedback controller synthesis for timed event graphs in dioids, where the number of initial tokens and time delays are only known to belong to intervals. We ...
202
Voted
APDC
1997
15 years 2 months ago
1997
Delaunaytriangulationhas beenmuchusedin suchapplicationsas volumerendering, shape representation, terrain modeling and so on. The main disadvantage of Delaunay triangulationis lar...