Sciweavers

302 search results - page 19 / 61
» Efficient Algorithms for the Longest Path Problem
Sort
View
JALC
2002
97views more  JALC 2002»
13 years 8 months ago
Semiring Frameworks and Algorithms for Shortest-Distance Problems
We define general algebraic frameworks for shortest-distance problems based on the structure of semirings. We give a generic algorithm for finding single-source shortest distances...
Mehryar Mohri
ESCIENCE
2007
IEEE
14 years 14 days 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...
SODA
2010
ACM
155views Algorithms» more  SODA 2010»
14 years 6 months ago
Road Network Reconstruction for Organizing Paths
We consider the problem of reconstructing a road network from a collection of path traces and provide guarantees on the accuracy of the reconstruction under reasonable assumptions...
Daniel Chen, Leonidas J. Guibas, John Hershberger,...
ANCS
2006
ACM
14 years 10 days ago
Packet classification using coarse-grained tuple spaces
While the problem of high performance packet classification has received a great deal of attention in recent years, the research community has yet to develop algorithmic methods t...
Haoyu Song, Jonathan S. Turner, Sarang Dharmapurik...
CORR
2008
Springer
116views Education» more  CORR 2008»
13 years 8 months ago
Optimal Scheduling of File Transfers with Divisible Sizes on Multiple Disjoint Paths
In this paper I investigate several offline and online data transfer scheduling problems and propose efficient algorithms and techniques for addressing them. In the offline case, ...
Mugurel Ionut Andreica