Sciweavers

79 search results - page 10 / 16
» A Recurrent Neural Network for Solving the Shortest Path Pro...
Sort
View
ICRA
1998
IEEE
142views Robotics» more  ICRA 1998»
13 years 11 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
IGPL
2010
97views more  IGPL 2010»
13 years 6 months ago
A symbolic/subsymbolic interface protocol for cognitive modeling
Researchers studying complex cognition have grown increasingly interested in mapping symbolic cognitive architectures onto subsymbolic brain models. Such a mapping seems essential...
Patrick Simen, Thad A. Polk
IJCNN
2007
IEEE
14 years 1 months ago
Risk Assessment Algorithms Based on Recursive Neural Networks
— The assessment of highly-risky situations at road intersections have been recently revealed as an important research topic within the context of the automotive industry. In thi...
Alejandro Chinea Manrique De Lara, Michel Parent
WCNC
2010
IEEE
13 years 11 months ago
Impact of Power Control on Relay Load Balancing in Wireless Sensor Networks
—When shortest path routing is employed in large scale multi-hop wireless networks, nodes located near the center of the network have to perform disproportional amount of relayin...
Parth H. Pathak, Rudra Dutta
JCT
1998
99views more  JCT 1998»
13 years 7 months ago
From Hall's Matching Theorem to Optimal Routing on Hypercubes
We introduce a concept of so-called disjoint ordering for any collection of finite sets. It can be viewed as a generalization of a system of distinctive representatives for the s...
Shuhong Gao, Beth Novick, Ke Qiu