Sciweavers

4565 search results - page 251 / 913
» Time Optimal Self-Stabilizing Algorithms
Sort
View
IPPS
2009
IEEE
15 years 7 months ago
Minimizing total busy time in parallel scheduling with application to optical networks
—We consider a scheduling problem in which a bounded number of jobs can be processed simultaneously by a single machine. The input is a set of n jobs J = {J1, . . . , Jn}. Each j...
Michele Flammini, Gianpiero Monaco, Luca Moscardel...
90
Voted
ICRA
2008
IEEE
114views Robotics» more  ICRA 2008»
15 years 7 months ago
Lazy localization using the Frozen-Time Smoother
— We present a new algorithm for solving the global localization problem called Frozen-Time Smoother (FTS). Time is ‘frozen’, in the sense that the belief always refers to th...
Andrea Censi, Gian Diego Tipaldi
107
Voted
ICNP
2005
IEEE
15 years 6 months ago
Stability and Sensitivity for Congestion Control in Wireless Networks with Time Varying Link Capacities
While extensive efforts have been devoted to providing optimization based, distributed congestion control schemes for efficient bandwidth utilization and fair allocation in both ...
Guohua Zhang, Yiyu Wu, Yonghe Liu
114
Voted
TR
2008
107views more  TR 2008»
15 years 18 days ago
A New Shared Segment Protection Method for Survivable Networks with Guaranteed Recovery Time
Shared Segment Protection (SSP), compared with Shared Path Protection (SPP), and Shared Link Protection (SLP), provides an optimal protection configuration due to the ability of ma...
János Tapolcai, Pin-Han Ho, Dominique Verch...
CPM
2004
Springer
107views Combinatorics» more  CPM 2004»
15 years 4 months ago
Sorting by Reversals in Subquadratic Time
The problem of sorting a signed permutation by reversals is inspired by genome rearrangements in computational molecular biology. Given two genomes represented as two signed permut...
Eric Tannier, Marie-France Sagot