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 ...
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...
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...
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...
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