Sciweavers

474 search results - page 57 / 95
» On Multicast Path Finding Algorithms
Sort
View
NETWORKING
2007
13 years 9 months ago
Maximum Energy Welfare Routing in Wireless Sensor Networks
Most routing algorithms for sensor networks focus on finding energy efficient paths to prolong the lifetime of sensor networks. As a result, the sensors on the efficient paths are ...
Changsoo Ok, Prasenjit Mitra, Seokcheon Lee, Sound...
AIPS
2010
13 years 10 months ago
Action Elimination and Plan Neighborhood Graph Search: Two Algorithms for Plan Improvement
Compared to optimal planners, satisficing planners can solve much harder problems but may produce overly costly and long plans. Plan quality for satisficing planners has become in...
Hootan Nakhost, Martin Müller 0003
ESA
2006
Springer
77views Algorithms» more  ESA 2006»
13 years 11 months ago
Traversing the Machining Graph
Abstract. Zigzag pocket machining (or 2D-milling) plays an important role in the manufacturing industry. The objective is to minimize the number of tool retractions in the zigzag m...
Danny Z. Chen, Rudolf Fleischer, Jian Li, Haitao W...
CGO
2003
IEEE
13 years 11 months ago
Optimal and Efficient Speculation-Based Partial Redundancy Elimination
Existing profile-guided partial redundancy elimination (PRE) methods use speculation to enable the removal of partial redundancies along more frequently executed paths at the expe...
Qiong Cai, Jingling Xue
INFOCOM
2006
IEEE
14 years 1 months ago
Session Privacy Enhancement by Traffic Dispersion
— Traditional network routing uses the single (shortest) path paradigm. This paradigm leaves the session vulnerable to a variety of security threats, such as eavesdropping. We pr...
Haim Zlatokrilov, Hanoch Levy