Sciweavers

2126 search results - page 125 / 426
» An optimization algorithm for imprecise multi-objective prob...
Sort
View
AIPS
2000
15 years 6 months ago
Admissible Heuristics for Optimal Planning
hsp and hspr are two recent planners that search the state-space using an heuristic function extracted from Strips encodings. hsp does a forward search from the initial state reco...
Patrik Haslum, Hector Geffner
CPHYSICS
2006
182views more  CPHYSICS 2006»
15 years 4 months ago
MinFinder: Locating all the local minima of a function
A new stochastic clustering algorithm is introduced that aims to locate all the local minima of a multidimensional continuous and differentiable function inside a bounded domain. ...
Ioannis G. Tsoulos, Isaac E. Lagaris
IJON
2008
177views more  IJON 2008»
15 years 4 months ago
An asynchronous recurrent linear threshold network approach to solving the traveling salesman problem
In this paper, an approach to solving the classical Traveling Salesman Problem (TSP) using a recurrent network of linear threshold (LT) neurons is proposed. It maps the classical ...
Eu Jin Teoh, Kay Chen Tan, H. J. Tang, Cheng Xiang...
NCA
2008
IEEE
15 years 4 months ago
Neurodynamic programming: a case study of the traveling salesman problem
The paper focuses on the study of solving the large-scale traveling salesman problem (TSP) based on neurodynamic programming. From this perspective, two methods, temporal differenc...
Jia Ma, Tao Yang, Zeng-Guang Hou, Min Tan, Derong ...
WABI
2007
Springer
109views Bioinformatics» more  WABI 2007»
15 years 10 months ago
Two Birds, One Stone: Selecting Functionally Informative Tag SNPs for Disease Association Studies
Selecting an informative subset of SNPs, generally referred to as tag SNPs, to genotype and analyze is considered to be an essential step toward effective disease association studi...
Phil Hyoun Lee, Hagit Shatkay