Sciweavers

838 search results - page 40 / 168
» Finding Optimal Solutions to Atomix
Sort
View
ATAL
2008
Springer
13 years 10 months ago
Cooperative search for optimizing pipeline operations
We present an application of a multi-agent cooperative search approach to the problem of optimizing gas pipeline operations, i.e. finding control parameters for a gas transmission...
T. Mora, Abu B. Sesay, Jörg Denzinger, Hossei...
CORR
2002
Springer
83views Education» more  CORR 2002»
13 years 8 months ago
Optimal Ordered Problem Solver
We introduce a general and in a certain sense time-optimal way of solving one problem after another, efficiently searching the space of programs that compute solution candidates, i...
Jürgen Schmidhuber
JAT
2010
171views more  JAT 2010»
13 years 3 months ago
Chebyshev approximation of the null function by an affine combination of complex exponential functions
We describe the theoretical solution of an approximation problem that uses a finite weighted sum of complex exponential functions. The problem arises in an optimization model for t...
Paul Armand, Joël Benoist, Elsa Bousquet
GECCO
2000
Springer
145views Optimization» more  GECCO 2000»
14 years 1 days ago
A New Genetic Algorithm for Minimum Span Frequency Assignment using Permutation and Clique
We propose a new Genetic Algorithm (GA) for solving the minimum span frequency assignment problem (MSFAP). The MSFAP is minimizing the range of the frequencies assigned to each tr...
Shouichi Matsui, Ken-ichi Tokoro
EOR
2008
91views more  EOR 2008»
13 years 8 months ago
A branch-and-bound algorithm for the linear ordering problem with cumulative costs
The Linear Ordering Problem with Cumulative Costs is an NP-hard combinatorial optimization problem arising from an application in UMTS mobile-phone communication systems. This pap...
Giovanni Righini