1197 search results - page 148 / 240 » Which Dynamic Constraint Problems Can Be Solved By Ants |
TON
2002
13 years 7 months ago
2002
Abstract--This paper addresses multicast routing in circuitswitched multihop optical networks employing wavelength-division multiplexing. We consider a model in which multicast com...
ADMA
2006
Springer
14 years 2 months ago
2006
Springer
The problem of finding anomaly has received much attention recently. However, most of the anomaly detection algorithms depend on an explicit definition of anomaly, which may be i...
ICARCV
2008
IEEE
14 years 2 months ago
2008
IEEE
— We consider a discrete-time dynamical system with Boolean and continuous states, with the continuous state propagating linearly in the continuous and Boolean state variables, a...
AMDO
2004
Springer
14 years 1 months ago
2004
Springer
We present a method to solve the human silhouette tracking problem using 18 major human points. We used: a simple 2D model for the human silhouette, a linear prediction technique f...
NCA
2003
IEEE
14 years 1 months ago
2003
IEEE
This paper studies the optimal placement of web files for en-route web caching. It is shown that existing placement policies are all solving restricted partial problems of the ...