Sciweavers

4255 search results - page 30 / 851
» Cover
Sort
View
WINE
2009
Springer
138views Economy» more  WINE 2009»
14 years 2 months ago
Covering Games: Approximation through Non-cooperation
We propose approximation algorithms under game-theoretic considerations. We indroduce and study the general covering problem which is a natural generalization of the well-studied m...
Martin Gairing
GECCO
2009
Springer
167views Optimization» more  GECCO 2009»
14 years 2 months ago
Fixed-parameter evolutionary algorithms and the vertex cover problem
In this paper, we consider multi-objective evolutionary algorithms for the Vertex Cover problem in the context of parameterized complexity. We relate the runtime of our algorithms...
Stefan Kratsch, Frank Neumann
IPSN
2010
Springer
14 years 2 months ago
Covering space for in-network sensor data storage
For in-network storage schemes, one maps data, indexed in a logical space, to the distributed sensor locations. When the physical sensor network has an irregular shape and possibl...
Rik Sarkar, Wei Zeng, Jie Gao, Xianfeng David Gu
ESA
2005
Springer
125views Algorithms» more  ESA 2005»
14 years 1 months ago
Online Primal-Dual Algorithms for Covering and Packing Problems
We study a wide range of online covering and packing optimization problems. In an online covering problem a linear cost function is known in advance, but the linear constraints th...
Niv Buchbinder, Joseph Naor
LREC
2008
133views Education» more  LREC 2008»
13 years 9 months ago
Comparing Set-Covering Strategies for Optimal Corpus Design
This article is interested in the problem of the linguistic content of a speech corpus. Depending on the target task, the phonological and linguistic content of the corpus is cont...
Jonathan Chevelu, Nelly Barbot, Olivier Boëff...