Sciweavers

11371 search results - page 41 / 2275
» The network inhibition problem
Sort
View
TIME
2006
IEEE
14 years 4 months ago
Ultimately Periodic Simple Temporal Problems (UPSTPs)
In this paper, we consider quantitative temporal or spatial constraint networks whose constraints evolve over time in an ultimately periodic fashion. These constraint networks are...
Jean-François Condotta, Gérard Ligoz...
HIS
2008
13 years 11 months ago
Solving the Railway Traveling Salesman Problem via a Transformation into the Classical Traveling Salesman Problem
The Railway Traveling Salesman Problem (RTSP) is a practical extension of the classical traveling salesman problem considering a railway network and train schedules. We are given ...
Bin Hu, Günther R. Raidl
AISS
2010
161views more  AISS 2010»
13 years 7 months ago
Two GRASP Metaheuristic for the Capacitated Vehicle Routing Problem Considering Split Delivery and Solving the Three Dimensional
The vehicle routing problem consists in determining a group of optimal delivery routes that allow satisfaction of the demand from customers spread along a network, which can be re...
Joseph Gallart Suarez, Manuel Tupia Anticona
WSNA
2003
ACM
14 years 3 months ago
The coverage problem in a wireless sensor network
One fundamental issue in sensor networks is the coverage problem, which reflects how well a sensor network is monitored or tracked by sensors. In this paper, we formulate this pr...
Chi-Fu Huang, Yu-Chee Tseng
PERCOM
2006
ACM
14 years 9 months ago
A Dynamic Graph Algorithm for the Highly Dynamic Network Problem
A recent flooding algorithm [1] guaranteed correctness for networks with dynamic edges and fixed nodes. The algorithm provided a partial answer to the highly dynamic network (HDN)...
Edwin Soedarmadji, Robert J. McEliece