Sciweavers

1182 search results - page 125 / 237
» Iterative Methods in Combinatorial Optimization
Sort
View
ICRA
1998
IEEE
142views Robotics» more  ICRA 1998»
15 years 7 months ago
Lagrangian Relaxation Neural Networks for Job Shop Scheduling
Abstract--Manufacturing scheduling is an important but difficult task. In order to effectively solve such combinatorial optimization problems, this paper presents a novel Lagrangia...
Peter B. Luh, Xing Zhao, Yajun Wang
KES
2008
Springer
15 years 3 months ago
Knowledge-based genetic algorithm for university course timetabling problems
This paper discusses a new solution to university course timetabling problems. The problems that belong to the NP-hard class are very difficult to solve using conventional optimiza...
Hitoshi Kanoh, Yuusuke Sakamoto
TNN
1998
114views more  TNN 1998»
15 years 2 months ago
Bayesian retrieval in associative memories with storage errors
Abstract—It is well known that for finite-sized networks, onestep retrieval in the autoassociative Willshaw net is a suboptimal way to extract the information stored in the syna...
Friedrich T. Sommer, Peter Dayan
CP
2009
Springer
16 years 3 months ago
Modelling Equidistant Frequency Permutation Arrays: An Application of Constraints to Mathematics
Equidistant Frequency Permutation Arrays are combinatorial objects of interest in coding theory. A frequency permutation array is a type of constant composition code in which each ...
Sophie Huczynska, Paul McKay, Ian Miguel, Peter Ni...
ICIAP
2005
ACM
16 years 3 months ago
Scatter Search Particle Filter for 2D Real-Time Hands and Face Tracking
This paper presents the scatter search particle filter (SSPF) algorithm and its application to real-time hands and face tracking. SSPF combines sequential Monte Carlo (particle fil...
Antonio S. Montemayor, Juan José Pantrigo, ...