Sciweavers

407 search results - page 37 / 82
» The Optimal Online Algorithms for Minimizing Maximum Latenes...
Sort
View
IPCO
2001
184views Optimization» more  IPCO 2001»
15 years 1 months ago
Approximation Algorithms for the Minimum Bends Traveling Salesman Problem
Problem (Extended Abstract) Cliff Stein David P. Wagner Dartmouth College Computer Science Technical Report TR2000-367 May 9, 2000 The problem of traversing a set of points in the...
Clifford Stein, David P. Wagner
ALGOSENSORS
2009
Springer
15 years 6 months ago
Building a Communication Bridge with Mobile Hubs
We study scenarios where mobile hubs are charged with building a communication bridge between two given points s and t. We introduce a new bi-criteria optimization problem where th...
Onur Tekdas, Yokesh Kumar, Volkan Isler, Ravi Jana...
ICCAD
2000
IEEE
188views Hardware» more  ICCAD 2000»
15 years 4 months ago
Bus Optimization for Low-Power Data Path Synthesis Based on Network Flow Method
— Sub-micron feature sizes have resulted in a considerable portion of power to be dissipated on the buses, causing an increased attention on savings for power at the behavioral l...
Sungpack Hong, Taewhan Kim
INFOCOM
2008
IEEE
15 years 6 months ago
Opportunistic Scheduling with Reliability Guarantees in Cognitive Radio Networks
—We develop opportunistic scheduling policies for cognitive radio networks that maximize the throughput utility of the secondary (unlicensed) users subject to maximum collision c...
Rahul Urgaonkar, Michael J. Neely
DAM
2008
135views more  DAM 2008»
14 years 12 months ago
Edge ranking and searching in partial orders
: We consider a problem of searching an element in a partially ordered set (poset). The goal is to find a search strategy which minimizes the number of comparisons. Ben-Asher, Farc...
Dariusz Dereniowski