925 search results - page 75 / 185 » Connectivity on Complete Lattices |
172
click to vote
GLVLSI
2008
IEEE
16 years 19 days ago
2008
IEEE
This paper presents in-order pulsed charge recycling to reduce energy consumption in an off-chip data bus. The proposed technique performs charge recycling by employing three step...
169
click to vote
WADS
2005
Springer
15 years 11 months ago
2005
Springer
Important generalizations of the Vertex Cover problem (Connected Vertex Cover, Capacitated Vertex Cover, and Maximum Partial Vertex Cover) have been intensively studied in terms of...
132
click to vote
CSCW
2000
ACM
15 years 10 months ago
2000
ACM
We outline some of the benefits of shared visual information for collaborative repair tasks and report on a study comparing collaborative performance on a manual task by workers a...
136
click to vote
STOC
1993
ACM
15 years 10 months ago
1993
ACM
We consider a class of routing problems on connected graphs G. Initially, each vertex v of G is occupied by a “pebble” which has a unique destination π(v) in G (so that π is...
144
click to vote
EPEW
2006
Springer
15 years 9 months ago
2006
Springer
In this paper we experimentally investigate if optimal retry times can be determined based on models that assume independence of successive tries. We do this using data obtained fo...