Sciweavers

7930 search results - page 193 / 1586
» Greedy in Approximation Algorithms
Sort
View
SPAA
2009
ACM
16 years 7 months ago
Approximation algorithms for time-constrained scheduling on line networks
We consider the problem of time-constrained scheduling of packets in a communication network. Each packet has, in addition to its source and its destination, a release time and a ...
Harald Räcke, Adi Rosén
DSD
2005
IEEE
123views Hardware» more  DSD 2005»
16 years 2 days ago
Hardware-Based Implementation of the Common Approximate Substring Algorithm
An implementation of an algorithm for string matching, commonly used in DNA string analysis, using configurable technology is proposed. The design of the circuit allows for pipeli...
Kenneth B. Kent, Sharon Van Schaick, Jacqueline E....
ATAL
2010
Springer
15 years 7 months ago
Incentive analysis of approximately efficient allocation algorithms
We present a series of results providing evidence that the incentive problem with VCG-based mechanisms is not very severe. Our first result uses average-case analysis to show that ...
Yevgeniy Vorobeychik, Yagil Engel
ADHOC
2010
292views more  ADHOC 2010»
15 years 6 months ago
Sleep/wake scheduling for multi-hop sensor networks: Non-convexity and approximation algorithm
We investigate the problem of sleep/wake scheduling for low duty cycle sensor networks. Our work differs from prior work in that we explicitly consider the effect of synchronizati...
Yan Wu, Sonia Fahmy, Ness B. Shroff
DAM
2008
111views more  DAM 2008»
15 years 6 months ago
Sums of squares based approximation algorithms for MAX-SAT
We investigate the Semidefinite Programming based Sums of squares (SOS) decomposition method, designed for global optimization of polynomials, in the context of the (Maximum) Sati...
Hans van Maaren, Linda van Norden, M. J. H. Heule