Sciweavers

4432 search results - page 30 / 887
» Solving Demodulation as an Optimization Problem
Sort
View
IJON
2008
177views more  IJON 2008»
13 years 10 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...
IJCNN
2000
IEEE
14 years 2 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
AIPS
2008
14 years 6 days ago
Using Constraint Networks on Timelines to Model and Solve Planning and Scheduling Problems
In the last decades, there has been an increasing interest in the connection between planning and constraint programming. Several approaches were used, leading to different forms ...
Cédric Pralet, Gérard Verfaillie
HEURISTICS
2002
146views more  HEURISTICS 2002»
13 years 9 months ago
Using Constraint-Based Operators to Solve the Vehicle Routing Problem with Time Windows
This paper presents operators searching large neighborhoods in order to solve the vehicle routing problem. They make use of the pruning and propagation techniques of constraint pr...
Louis-Martin Rousseau, Michel Gendreau, Gilles Pes...
VTC
2010
IEEE
125views Communications» more  VTC 2010»
13 years 8 months ago
Solving the Coupon Collector's Problem for the Safety Beaconing in the IEEE 802.11p WAVE
—For the WAVE applications built on safety beacons, it is imperative that the neighboring vehicle information be collected as quickly and efficiently as possible. But the unreli...
Hyundoc Seo, Sangki Yun, Hyogon Kim