Sciweavers

986 search results - page 51 / 198
» Algorithmic Lower Bounds for Problems Parameterized by Cliqu...
Sort
View
CONSTRAINTS
2008
78views more  CONSTRAINTS 2008»
13 years 7 months ago
Boosting Haplotype Inference with Local Search
Abstract. A very challenging problem in the genetics domain is to infer haplotypes from genotypes. This process is expected to identify genes affecting health, disease and response...
Inês Lynce, João Marques-Silva, Steve...
JCO
2008
84views more  JCO 2008»
13 years 7 months ago
Partitioning a weighted partial order
The problem of partitioning a partially ordered set into a minimum number of chains is a well-known problem. In this paper we study a generalization of this problem, where we not ...
Linda S. Moonen, Frits C. R. Spieksma
HEURISTICS
2006
197views more  HEURISTICS 2006»
13 years 7 months ago
Bucket elimination for multiobjective optimization problems
Multiobjective optimization deals with problems involving multiple measures of performance that should be optimized simultaneously. In this paper we extend bucket elimination (BE),...
Emma Rollon, Javier Larrosa
TALG
2010
123views more  TALG 2010»
13 years 6 months ago
Lower-bounded facility location
We study the lower-bounded facility location problem, which generalizes the classical uncapacitated facility location problem in that it comes with lower bound constraints for the...
Zoya Svitkina
OPODIS
2008
13 years 9 months ago
On the Time-Complexity of Robust and Amnesic Storage
We consider wait-free implementations of a regular read/ write register for unauthenticated data using a collection of 3t + k base objects, t of which can be subject to Byzantine ...
Dan Dobre, Matthias Majuntke, Neeraj Suri