Sciweavers

1424 search results - page 104 / 285
» The Multi-radius Cover Problem
Sort
View
JCO
2008
85views more  JCO 2008»
15 years 6 months ago
Locating and detecting arrays for interaction faults
The identification of interaction faults in component-based systems has focussed on indicating the presence of faults, rather than their location and magnitude. While this is a va...
Charles J. Colbourn, Daniel W. McClary
TOC
2008
122views more  TOC 2008»
15 years 6 months ago
Derandomizing the Ahlswede-Winter matrix-valued Chernoff bound using pessimistic estimators, and applications
: Ahlswede and Winter [IEEE Trans. Inf. Th. 2002] introduced a Chernoff bound for matrix-valued random variables, which is a non-trivial generalization of the usual Chernoff bound ...
Avi Wigderson, David Xiao
COMPGEOM
2006
ACM
16 years 8 days ago
Minimum-cost coverage of point sets by disks
We consider a class of geometric facility location problems in which the goal is to determine a set X of disks given by their centers (tj) and radii (rj) that cover a given set of...
Helmut Alt, Esther M. Arkin, Hervé Brö...
GECCO
2007
Springer
149views Optimization» more  GECCO 2007»
16 years 14 days ago
Optimal antenna placement using a new multi-objective chc algorithm
Radio network design (RND) is a fundamental problem in cellular networks for telecommunications. In these networks, the terrain must be covered by a set of base stations (or anten...
Antonio J. Nebro, Enrique Alba, Guillermo Molina, ...
EOR
2006
61views more  EOR 2006»
15 years 6 months ago
Scheduling trainees at a hospital department using a branch-and-price approach
Scheduling trainees (graduate students) is a complicated problem that has to be solved frequently in many hospital departments. We will describe a trainee-scheduling problem encou...
Jeroen Beliën, Erik Demeulemeester