Sciweavers

196 search results - page 31 / 40
» New Algorithms for Optimal Online Checkpointing
Sort
View
SAC
2008
ACM
13 years 6 months ago
Expected energy consumption minimization in DVS systems with discrete frequencies
Energy-efficiency has been an important system issue in hardware and software designs to extend operation duration or cut power bills. This research explores systems with probabil...
Jian-Jia Chen
CONEXT
2006
ACM
14 years 1 months ago
Using forgetful routing to control BGP table size
Running the Border Gateway Protocol (BGP), the Internet’s interdomain routing protocol, consumes a large amount of memory. A BGP-speaking router typically stores one or more rou...
Elliott Karpilovsky, Jennifer Rexford
SODA
2010
ACM
202views Algorithms» more  SODA 2010»
14 years 4 months ago
Counting Inversions, Offline Orthogonal Range Counting, and Related Problems
We give an O(n lg n)-time algorithm for counting the number of inversions in a permutation on n elements. This improves a long-standing previous bound of O(n lg n/ lg lg n) that ...
Timothy M. Chan, Mihai Patrascu
ESA
2008
Springer
95views Algorithms» more  ESA 2008»
13 years 9 months ago
Speed Scaling Functions for Flow Time Scheduling Based on Active Job Count
Abstract. We study online scheduling to minimize flow time plus energy usage in the dynamic speed scaling model. We devise new speed scaling functions that depend on the number of ...
Tak Wah Lam, Lap-Kei Lee, Isaac Kar-Keung To, Prud...
AAAI
2006
13 years 8 months ago
Estimating Search Tree Size
We propose two new online methods for estimating the size of a backtracking search tree. The first method is based on a weighted sample of the branches visited by chronological ba...
Philip Kilby, John K. Slaney, Sylvie Thiéba...