Sciweavers

4526 search results - page 569 / 906
» Algorithmic problems related to the Internet
Sort
View
INFOCOM
2006
IEEE
16 years 1 months ago
Super-Fast Delay Tradeoffs for Utility Optimal Fair Scheduling in Wireless Networks
— We consider the fundamental delay tradeoffs for utility optimal scheduling in a general network with time varying channels. A network controller acts on randomly arriving data ...
Michael J. Neely
COCOON
2005
Springer
16 years 1 months ago
Perfect Sorting by Reversals
In computational biology, gene order data is often modelled as signed permutations. A classical problem in genome comparison is to detect conserved segments in a permutation, that ...
Marie-France Sagot, Eric Tannier
ISAAC
2004
Springer
153views Algorithms» more  ISAAC 2004»
16 years 27 days ago
Canonical Data Structure for Interval Probe Graphs
The class of interval probe graphs is introduced to deal with the physical mapping and sequencing of DNA as a generalization of interval graphs. The polynomial time recognition al...
Ryuhei Uehara
PLDI
2000
ACM
15 years 11 months ago
Off-line variable substitution for scaling points-to analysis
Most compiler optimizations and software productivity tools rely on information about the effects of pointer dereferences in a program. The purpose of points-to analysis is to com...
Atanas Rountev, Satish Chandra
195
Voted
CDC
2008
IEEE
166views Control Systems» more  CDC 2008»
15 years 9 months ago
Distributed coverage verification in sensor networks without location information
In this paper, we present a series of distributed algorithms for coverage verification in sensor networks with no location information. We demonstrate how, in the absence of locali...
Alireza Tahbaz-Salehi, Ali Jadbabaie