2398 search results - page 118 / 480 » Constraint Programming and Graph Algorithms |
156
Voted
PPOPP
2005
ACM
15 years 10 months ago
2005
ACM
We want to perform compile-time analysis of an SPMD program and place barriers in it to synchronize it correctly, minimizing the runtime cost of the synchronization. This is the b...
153
click to vote
CORR
2011
Springer
14 years 12 months ago
2011
Springer
In this paper, we study the average case complexity of the Unique Games problem. We propose a natural semi-random model, in which a unique game instance is generated in several st...
132
click to vote
ASPDAC
2004
ACM
15 years 8 months ago
2004
ACM
Non-rectangular (rectilinear) shape occurs very often in deep submicron floorplanning. Most previous algorithms are designed to handle only convex rectilinear blocks. However, han...
140
Voted
EWSN
2006
Springer
16 years 4 months ago
2006
Springer
Abstract. We propose a lightweight localisation approach for supporting distance and range queries in ad hoc wireless sensor networks. In contrast to most previous localisation app...
138
click to vote
IWQOS
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. Previous work have assumed an independent model for overlay networks: a graph with independent link capacities. We introduce a model of overlays (LCC-overlay) which incor...