Sciweavers

4112 search results - page 42 / 823
» Efficient Algorithms for the Spoonerism Problem
Sort
View
169
Voted
HIS
2008
15 years 5 months ago
Solving the Railway Traveling Salesman Problem via a Transformation into the Classical Traveling Salesman Problem
The Railway Traveling Salesman Problem (RTSP) is a practical extension of the classical traveling salesman problem considering a railway network and train schedules. We are given ...
Bin Hu, Günther R. Raidl
153
Voted
GECCO
2005
Springer
190views Optimization» more  GECCO 2005»
15 years 9 months 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
135
Voted
GECCO
2004
Springer
132views Optimization» more  GECCO 2004»
15 years 9 months ago
Robust and Efficient Genetic Algorithms with Hierarchical Niching and a Sustainable Evolutionary Computation Model
This paper proposes a new niching method named hierarchical niching, which combines spatial niching in search space and a continuous temporal niching concept. The method is natural...
Jianjun Hu, Erik D. Goodman
119
Voted
JMLR
2010
111views more  JMLR 2010»
14 years 10 months ago
An EM Algorithm on BDDs with Order Encoding for Logic-based Probabilistic Models
Logic-based probabilistic models (LBPMs) enable us to handle problems with uncertainty succinctly thanks to the expressive power of logic. However, most of LBPMs have restrictions...
Masakazu Ishihata, Yoshitaka Kameya, Taisuke Sato,...
117
Voted
CORR
2008
Springer
76views Education» more  CORR 2008»
15 years 3 months ago
An Efficient Algorithm for a Sharp Approximation of Universally Quantified Inequalities
This paper introduces a new algorithm for solving a subclass of quantified constraint satisfaction problems (QCSP) where existential quantifiers precede universally quantified ine...
Alexandre Goldsztejn, Claude Michel, Michel Rueher