4110 search results - page 59 / 822 » Efficient algorithms for the 2-gathering problem |
130
Voted
COLT
2004
Springer
15 years 7 months ago
2004
Springer
straction of the following scenarios: choosing from among a set of alternative treatments after a fixed number of clinical trials, determining the best parameter settings for a pro...
142
Voted
AHSWN
2006
15 years 3 months ago
2006
Abstract-- We present a new, biologically-inspired algorithm for the problem of covering a given region with wireless "units" (sensors or base-stations). The general prob...
120
click to vote
COMPUTING
2006
15 years 3 months ago
2006
Abstract We are dealing with the optimal, i.e. densest packings of congruent circles into the unit square. In the recent years we have built a numerically reliable, verified method...
123
Voted
HM
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. We discuss a general approach to hybridize traditional construction heuristics for combinatorial optimization problems with numerical based evolutionary algorithms. There...
113
click to vote
DNA
2004
Springer
15 years 9 months ago
2004
Springer
Most DNA computing algorithms for mathematical problems start with combinatorial generation of an initial pool. Several methods for initialpool generation have been proposed, inclu...