Sciweavers

2252 search results - page 148 / 451
» Lower Bounds for Dynamic Algorithms
Sort
View
ICDE
2007
IEEE
109views Database» more  ICDE 2007»
16 years 4 months ago
Evaluating Proximity Relations Under Uncertainty
For location-based services it is often essential to efficiently process proximity relations among mobile objects, such as to establish whether a group of friends or family member...
Zhengdao Xu, Hans-Arno Jacobsen
111
Voted
ICCAD
2003
IEEE
158views Hardware» more  ICCAD 2003»
16 years 9 days ago
Approaching the Maximum Energy Saving on Embedded Systems with Multiple Voltages
Dynamic voltage scaling (DVS) is arguably the most effective energy reduction technique. The multiple-voltage DVS systems, which can operate only at pre-determined discrete voltag...
Shaoxiong Hua, Gang Qu
DNA
2007
Springer
15 years 9 months ago
Staged Self-assembly: Nanomanufacture of Arbitrary Shapes with O (1) Glues
We introduce staged self-assembly of Wang tiles, where tiles can be added dynamically in sequence and where intermediate constructions can be stored for later mixing. This model a...
Erik D. Demaine, Martin L. Demaine, Sándor ...
ICPADS
2005
IEEE
15 years 9 months ago
Efficient Distributed QoS Routing Protocol for MPLS Networks
- This paper proposes a new distributed QoS routing protocol, called Efficient Distributed QoS Routing (EDQR), for MPLS networks. The path searching algorithm of EDQR considers an ...
Man-Ching Yuen, Weijia Jia, Chi-Chung Cheung
120
Voted
WG
1995
Springer
15 years 7 months ago
On Interval Routing Schemes and Treewidth
Abstract. In this paper, we investigate which processor networks allow klabel Interval Routing Schemes, under the assumption that costs of edges may vary. We show that for each xed...
Hans L. Bodlaender, Richard B. Tan, Dimitrios M. T...