13376 search results - page 332 / 2676 » Problem Solving with |
139
click to vote
GECCO
2009
Springer
15 years 8 months ago
2009
Springer
High–dimensional optimization problems appear very often in demanding applications. Although evolutionary algorithms constitute a valuable tool for solving such problems, their ...
145
Voted
AHSWN
2006
15 years 4 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...
131
click to vote
CSC
2008
15 years 5 months ago
2008
- The set-covering problem is an interesting problem in computational complexity theory. In [1], the setcovering problem has been proved to be NP hard and a greedy heuristic algori...
140
Voted
IJCAI
2007
15 years 5 months ago
2007
In the context of operative disruption management, decision support systems have to evaluate the typically manifold options of responding to disturbances: The temporal shift of ac...
124
Voted
ECCC
2006
15 years 4 months ago
2006
We investigate the computational complexity of finding an element of a permutation group H Sn with a minimal distance to a given Sn, for different metrics on Sn. We assume that...