Sciweavers

91 search results - page 4 / 19
» Solving the Weighted Constraint Satisfaction Problems Via th...
Sort
View
IJCNN
2000
IEEE
13 years 9 months ago
Using Hopfield Networks to Solve Traveling Salesman Problems Based on Stable State Analysis Technique
In our recent work, a general method called the stable state analysis technique was developed to determine constraints that the weights in the Hopfield energy function must satisf...
Gang Feng, Christos Douligeris
ICTAI
2009
IEEE
13 years 3 months ago
A Generalized Cyclic-Clustering Approach for Solving Structured CSPs
We propose a new method for solving structured CSPs which generalizes and improves the Cyclic-Clustering approach [4]. First, the cutset and the tree-decomposition of the constrai...
Cédric Pinto, Cyril Terrioux
ISTCS
1993
Springer
13 years 9 months ago
Analog Computation Via Neural Networks
We pursue a particular approach to analog computation, based on dynamical systems of the type used in neural networks research. Our systems have a xed structure, invariant in time...
Hava T. Siegelmann, Eduardo D. Sontag
AEI
2000
120views more  AEI 2000»
13 years 5 months ago
A neural network approach for a robot task sequencing problem
This paper presents a neural network approach with successful implementation for the robot task-sequencing problem. The problem addresses the sequencing of tasks comprising loadin...
Oded Maimon, Dan Braha, Vineet Seth
PRICAI
2004
Springer
13 years 10 months ago
Solving Over-Constrained Temporal Reasoning Problems Using Local Search
Temporal reasoning is an important task in many areas of computer science including planning, scheduling, temporal databases and instruction optimisation for compilers. Given a kno...
Matthew Beaumont, John Thornton, Abdul Sattar, Mic...