Sciweavers

302 search results - page 30 / 61
» Efficient Algorithms for the Longest Path Problem
Sort
View
ISAAC
2010
Springer
308views Algorithms» more  ISAAC 2010»
13 years 6 months ago
Levelwise Mesh Sparsification for Shortest Path Queries
Shortest path query is a problem to answer the shortest path from the origin to the destination in short time. The network is fixed, and the goal of the study is to develop efficie...
Yuichiro Miyamoto, Takeaki Uno, Mikio Kubo
ICPP
2009
IEEE
13 years 6 months ago
Employing Transactional Memory and Helper Threads to Speedup Dijkstra's Algorithm
In this paper we work on the parallelization of the inherently serial Dijkstra's algorithm on modern multicore platforms. Dijkstra's algorithm is a greedy algorithm that ...
Konstantinos Nikas, Nikos Anastopoulos, Georgios I...
COMPGEOM
2004
ACM
14 years 11 days ago
Continuous path verification in multi-axis NC-machining
We introduce a new approach to the problem of collision detection between a rotating milling-cutter of an NC-machine and a model of a solid workpiece, as the rotating cutter conti...
Ron Wein, Oleg Ilushin, Gershon Elber, Dan Halperi...
ICC
2009
IEEE
207views Communications» more  ICC 2009»
14 years 3 months ago
Energy Efficient Collision Aware Multipath Routing for Wireless Sensor Networks
—Multipath routing can reduce the need for route updates, balance the traffic load and increase the data transfer rate in a wireless sensor network, improving the utilization of ...
Zijian Wang, Eyuphan Bulut, Boleslaw K. Szymanski
EDBT
2010
ACM
143views Database» more  EDBT 2010»
13 years 12 months ago
Efficient and scalable multi-geography route planning
This paper considers the problem of Multi-Geography Route Planning (MGRP) where the geographical information may be spread over multiple heterogeneous interconnected maps. We firs...
Vidhya Balasubramanian, Dmitri V. Kalashnikov, Sha...