Sciweavers

1452 search results - page 124 / 291
» Algorithmic Analysis of Array-Accessing Programs
Sort
View
PODC
2009
ACM
16 years 1 months ago
Distributed and parallel algorithms for weighted vertex cover and other covering problems
The paper presents distributed and parallel -approximation algorithms for covering problems, where is the maximum number of variables on which any constraint depends (for example...
Christos Koufogiannakis, Neal E. Young
99
Voted
HIPEAC
2005
Springer
15 years 6 months ago
Induction Variable Analysis with Delayed Abstractions
ions Sebastian Pop 1 , Albert Cohen 2 , and Georges-Andr´e Silber 1 1 CRI, Mines Paris, Fontainebleau, France 2 ALCHEMY group, INRIA Futurs, Orsay, France Abstract. This paper pre...
Sebastian Pop, Albert Cohen, Georges-André ...
115
Voted
CORR
2008
Springer
86views Education» more  CORR 2008»
15 years 19 days ago
Design by Measure and Conquer, A Faster Exact Algorithm for Dominating Set
The measure and conquer approach has proven to be a powerful tool to analyse exact algorithms for combinatorial problems, like Dominating Set and Independent Set. In this paper, we...
Johan M. M. van Rooij, Hans L. Bodlaender
105
Voted
PPOPP
2006
ACM
15 years 6 months ago
High-performance IPv6 forwarding algorithm for multi-core and multithreaded network processor
IP forwarding is one of the main bottlenecks in Internet backbone routers, as it requires performing the longest-prefix match at 10Gbps speed or higher. IPv6 forwarding further ex...
Xianghui Hu, Xinan Tang, Bei Hua
SODA
2008
ACM
77views Algorithms» more  SODA 2008»
15 years 1 months ago
Online make-to-order joint replenishment model: primal dual competitive algorithms
In this paper, we study an online make-to-order variant of the classical joint replenishment problem (JRP) that has been studied extensively over the years and plays a fundamental...
Niv Buchbinder, Tracy Kimbrel, Retsef Levi, Konsta...