Sciweavers

3875 search results - page 648 / 775
» Approximation algorithms for the 0-extension problem
Sort
View
VMCAI
2005
Springer
15 years 10 months ago
On the Complexity of Error Explanation
When a system fails to satisfy its specification, the model checker produces an error trace (or counter-example) that demonstrates an undesirable behavior, which is then used in d...
Nirman Kumar, Viraj Kumar, Mahesh Viswanathan
ADHOCNOW
2009
Springer
15 years 5 months ago
On Minimizing the Maximum Sensor Movement for Barrier Coverage of a Line Segment
We consider n mobile sensors located on a line containing a barrier represented by a finite line segment. Sensors form a wireless sensor network and are able to move within the lin...
Jurek Czyzowicz, Evangelos Kranakis, Danny Krizanc...
ICALP
2004
Springer
15 years 9 months ago
Online Scheduling with Bounded Migration
Consider the classical online scheduling problem where jobs that arrive one by one are assigned to identical parallel machines with the objective of minimizing the makespan. We gen...
Peter Sanders, Naveen Sivadasan, Martin Skutella
CORR
2010
Springer
93views Education» more  CORR 2010»
15 years 4 months ago
Rank Awareness in Joint Sparse Recovery
In this paper we revisit the sparse multiple measurement vector (MMV) problem, where the aim is to recover a set of jointly sparse multichannel vectors from incomplete measurement...
Mike E. Davies, Yonina C. Eldar
SODA
2008
ACM
109views Algorithms» more  SODA 2008»
15 years 5 months ago
Auctions for structured procurement
This paper considers a general setting for structured procurement and the problem a buyer faces in designing a procurement mechanism to maximize profit. This brings together two a...
Matthew Cary, Abraham D. Flaxman, Jason D. Hartlin...