Sciweavers

335 search results - page 16 / 67
» Solving the Hamiltonian path problem with a light-based comp...
Sort
View
ESA
2005
Springer
176views Algorithms» more  ESA 2005»
14 years 28 days ago
On Degree Constrained Shortest Paths
Abstract. Traditional shortest path problems play a central role in both the design and use of communication networks and have been studied extensively. In this work, we consider a...
Samir Khuller, Kwangil Lee, Mark A. Shayman
CEC
2010
IEEE
12 years 11 months ago
Co-evolutionary search path planning under constrained information-sharing for a cooperative unmanned aerial vehicle team
—Mobile cooperative sensor networks are increasingly used for surveillance and reconnaissance tasks to support domain picture compilation. However, efficient distributed informat...
Jean Berger, Jens Happe
LCN
2005
IEEE
14 years 1 months ago
Light-Trail Networks: Design and Survivability
The light-trail architecture provides a novel solution to address IP-centric issues at the optical layer. By incorporating drop and continue functionality, overlaid with a lightwe...
Srivatsan Balasubramanian, Wensheng He, Arun K. So...
STACS
2010
Springer
14 years 2 months ago
On Iterated Dominance, Matrix Elimination, and Matched Paths
We study computational problems that arise in the context of iterated dominance in anonymous games, and show that deciding whether a game can be solved by means of iterated weak d...
Felix Brandt, Felix A. Fischer, Markus Holzer
ESCIENCE
2007
IEEE
13 years 11 months ago
Using Ant Colony Optimisation to Improve the Efficiency of Small Meander Line RFID Antennas
Increasing the efficiency of meander line antennas is an important real-world problem within radio frequency identification (RFID). Meta-heuristic search algorithms, such as ant c...
Marcus Randall, Andrew Lewis, Amir Galehdar, David...