Sciweavers

1029 search results - page 5 / 206
» Local Minima Embedding
Sort
View
AMAI
1999
Springer
14 years 9 months ago
The Local Minima of the Error Surface of the 2-2-1 XOR Network
Ida G. Sprinkhuizen-Kuyper, Egbert J. W. Boers
DAWAK
2005
Springer
15 years 3 months ago
Gene Expression Biclustering Using Random Walk Strategies
A biclustering algorithm, based on a greedy technique and enriched with a local search strategy to escape poor local minima, is proposed. The algorithm starts with an initial rando...
Fabrizio Angiulli, Clara Pizzuti
ISCI
2008
102views more  ISCI 2008»
14 years 9 months ago
Random walk biclustering for microarray data
A biclustering algorithm, based on a greedy technique and enriched with a local search strategy to escape poor local minima, is proposed. The algorithm starts with an initial rand...
Fabrizio Angiulli, Eugenio Cesario, Clara Pizzuti
AAAI
2000
14 years 11 months ago
Human-Guided Simple Search
Scheduling, routing, and layout tasks are examples of hard operations-research problems that have broad application in industry. Typical algorithms for these problems combine some...
David Anderson, Emily Anderson, Neal Lesh, Joe Mar...
ICDAR
2009
IEEE
15 years 4 months ago
A New Approach for Skew Correction of Documents Based on Particle Swarm Optimization
This paper presents a novel approach for skew correction of documents. Skew correction is modelled as an optimization problem, and for the first time, Particle Swarm Optimization...
Javad Sadri, Mohamed Cheriet