Sciweavers

763 search results - page 113 / 153
» Engineering Shortest Path Algorithms
Sort
View
IEEEARES
2006
IEEE
14 years 3 months ago
Diagnosis of Complex Systems Using Ant Colony Decision Petri Nets
Failure diagnosis in large and complex systems is a critical task. A discrete event system (DES) approach to the problem of failure diagnosis is presented in this paper. A classic...
Calin Ciufudean, Adrian Graur, Constantin Filote, ...
ICCV
2005
IEEE
14 years 3 months ago
Space-Time Scene Manifolds
The space of images is known to be a non-linear subspace that is difficult to model. This paper derives an algorithm that walks within this space. We seek a manifold through the ...
Yonatan Wexler, Denis Simakov
ICNP
2005
IEEE
14 years 3 months ago
Efficient Hop ID based Routing for Sparse Ad Hoc Networks
Routing in mobile ad hoc networks remains as a challenging problem given the limited wireless bandwidth, users’ mobility and potentially large scale. Recently, there has been a ...
Yao Zhao, Bo Li, Qian Zhang, Yan Chen, Wenwu Zhu
WIOPT
2005
IEEE
14 years 3 months ago
Minimum Energy Transmission Scheduling Subject to Deadline Constraints
We consider the problem of transmission scheduling of data over a wireless fading channel with hard deadline constraints. Our system consists of N users, each with a fixed amount...
Alessandro Tarello, Jun Sun 0007, Murtaza Zafer, E...
PPSN
2004
Springer
14 years 3 months ago
Experimental Supplements to the Theoretical Analysis of EAs on Problems from Combinatorial Optimization
It is typical for the EA community that theory follows experiments. Most theoretical approaches use some model of the considered evolutionary algorithm (EA) but there is also some ...
Patrick Briest, Dimo Brockhoff, Bastian Degener, M...