Sciweavers

1332 search results - page 88 / 267
» Combinatorial Algorithms
Sort
View
103
Voted
GECCO
2006
Springer
145views Optimization» more  GECCO 2006»
15 years 6 months ago
Multi-objective genetic algorithms for pipe arrangement design
This paper presents an automatic design method for piping arrangement. A pipe arrangement design problem is proposed for a space in which many pipes and objects co-exist. This pro...
Satoshi Ikehira, Hajime Kimura
SPDP
1991
IEEE
15 years 5 months ago
Asynchronous parallel search by the parallel genetic algorithm
The parallel genetic algorithm (PGA) is a prototype of a new kind of a distributed algorithm. It is based on a parallel search by individuals all of which have the complete proble...
Heinz Mühlenbein
DATESO
2010
150views Database» more  DATESO 2010»
15 years 10 days ago
Evolving Quasigroups by Genetic Algorithms
Abstract. Quasigroups are a well-known combinatorial design equivalent to more familiar Latin squares. Because all possible elements of a quasigroup occur with equal probability, i...
Václav Snásel, Jiri Dvorský, ...
ESA
2003
Springer
111views Algorithms» more  ESA 2003»
15 years 7 months ago
Fast Smallest-Enclosing-Ball Computation in High Dimensions
Abstract. We develop a simple combinatorial algorithm for computing the smallest enclosing ball of a set of points in high dimensional Euclidean space. The resulting code is in mos...
Kaspar Fischer, Bernd Gärtner, Martin Kutz
STOC
2004
ACM
118views Algorithms» more  STOC 2004»
16 years 2 months ago
Boosted sampling: approximation algorithms for stochastic optimization
Several combinatorial optimization problems choose elements to minimize the total cost of constructing a feasible solution that satisfies requirements of clients. In the STEINER T...
Anupam Gupta, Martin Pál, R. Ravi, Amitabh ...