Sciweavers

657 search results - page 88 / 132
» Polynomial Time Algorithms for Minimum Energy Scheduling
Sort
View
COCOON
2005
Springer
15 years 9 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
STOC
2007
ACM
181views Algorithms» more  STOC 2007»
16 years 4 months ago
How to rank with few errors
We present a polynomial time approximation scheme (PTAS) for the minimum feedback arc set problem on tournaments. A simple weighted generalization gives a PTAS for KemenyYoung ran...
Claire Kenyon-Mathieu, Warren Schudy
MOBIWAC
2006
ACM
15 years 10 months ago
Quick convergecast in ZigBee/IEEE 802.15.4 tree-based wireless sensor networks
Convergecast is a fundamental operation in wireless sensor networks. Existing convergecast solutions have focused on reducing latency and energy consumption. However, a good desig...
Yu-Chee Tseng, Meng-Shiuan Pan
SODA
2001
ACM
110views Algorithms» more  SODA 2001»
15 years 5 months ago
IMproved results for route planning in stochastic transportation
In the bus network problem, the goal is to generate a plan for getting from point X to point Y within a city using buses in the smallest expected time. Because bus arrival times a...
Justin A. Boyan, Michael Mitzenmacher
COR
2006
96views more  COR 2006»
15 years 4 months ago
Scheduling two parallel machines with a single server: the general case
This paper considers the problem of scheduling two-operation non-preemptable jobs on two identical semiautomatic machines. A single server is available to carry out the first (or ...
Amir H. Abdekhodaee, Andrew Wirth, Heng-Soon Gan