Sciweavers

4229 search results - page 367 / 846
» On the Optimality of Spiral Search
Sort
View
EOR
2008
91views more  EOR 2008»
15 years 6 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
ICML
2002
IEEE
16 years 7 months ago
Learning from Scarce Experience
Searching the space of policies directly for the optimal policy has been one popular method for solving partially observable reinforcement learning problems. Typically, with each ...
Leonid Peshkin, Christian R. Shelton
CEC
2007
IEEE
16 years 1 months ago
On improving approximate solutions by evolutionary algorithms
Abstract—Hybrid methods are very popular for solving problems from combinatorial optimization. In contrast to this the theoretical understanding of the interplay of different opt...
Tobias Friedrich, Jun He, Nils Hebbinghaus, Frank ...
193
Voted
GECCO
2005
Springer
190views Optimization» more  GECCO 2005»
16 years 9 days ago
An efficient evolutionary algorithm applied to the design of two-dimensional IIR filters
This paper presents an efficient technique of designing twodimensional IIR digital filters using a new algorithm involving the tightly coupled synergism of particle swarm optimiza...
Swagatam Das, Amit Konar, Uday Kumar Chakraborty
GECCO
2005
Springer
207views Optimization» more  GECCO 2005»
16 years 9 days ago
Adaptive crossover and mutation in genetic algorithms based on clustering technique
Instead of having fixed px and pm, this paper presents the use of fuzzy logic to adaptively tune px and pm for optimization of power electronic circuits throughout the process. By...
Jun Zhang, Henry Shu-Hung Chung, Jinghui Zhong