Sciweavers

4345 search results - page 519 / 869
» Temporal Constraint Networks
Sort
View
ICRA
1998
IEEE
142views Robotics» more  ICRA 1998»
15 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
RTSS
1997
IEEE
15 years 11 months ago
Static priority scheduling for ATM networks
Static-priority scheduling is popular for traffic scheduling in ATM switches because it is less costly than dynamic priority scheduling while being sensitive to the delay constra...
Chengzhi Li, Riccardo Bettati, Wei Zhao
AINA
2006
IEEE
15 years 10 months ago
Efficient Packet Scheduler For Wireless Ad Hoc Networks With Switched Beam Antennas
Using beam forming antennas in ad hoc networks have been recently focused on, in order to improve the space reuse. This news context implies to revisit network algorithms because t...
Gilles Grimaud, Antoine Honore, Hervé Meuni...
APNOMS
2006
Springer
15 years 10 months ago
NETSAQ: Network State Adaptive QoS Provisioning for MANETs
The provision of ubiquitous services in Mobile Ad-hoc Networks (MANETs) is a great challenge, considering the bandwidth, mobility, and computational-resources constraints exhibited...
Shafique Ahmad Chaudhry, Faysal Adeem Siddiqui, Al...
DICS
2006
15 years 10 months ago
Algorithms for Failure Protection in Large IP-over-fiber and Wireless Ad Hoc Networks
We address failure location and restoration in both optical and wireless ad hoc networks. First, we show how Maximum Likelihood inference can improve failure location algorithms in...
Frederick Ducatelle, Luca Maria Gambardella, Macie...