4114 search results - page 47 / 823 » Efficient Algorithms for the 2-Center Problems |
130
click to vote
IJDMB
2006
15 years 4 months ago
2006
: Most motif discovery algorithms from DNA sequences require the motif's length as input. Styczynski et al. introduced the Extended (l,d)-Motif Problem (EMP) where the motif&#...
171
click to vote
HIS
2008
15 years 5 months ago
2008
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 ...
159
click to vote
GECCO
2005
Springer
15 years 10 months ago
2005
Springer
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...
142
click to vote
GECCO
2004
Springer
15 years 9 months ago
2004
Springer
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...
123
click to vote
JMLR
2010
14 years 11 months ago
2010
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...