Sciweavers

1508 search results - page 101 / 302
» Efficient Path Profiling
Sort
View
IJRR
2007
104views more  IJRR 2007»
14 years 11 months ago
Deep Space Formation Flying Spacecraft Path Planning
Efficient algorithms for collision-free energy sub-optimal path planning for formations of spacecraft flying in deep space are presented. The idea is to introduce a set of way-poi...
Cornel Sultan, Sanjeev Seereeram, Raman K. Mehra
WWW
2008
ACM
14 years 11 months ago
Divide, Compress and Conquer: Querying XML via Partitioned Path-Based Compressed Data Blocks
We propose a novel Partition Path-Based (PPB) grouping strategy to store compressed XML data in a stream of blocks. In addition, we employ a minimal indexing scheme called Block S...
Wilfred Ng, Ho Lam Lau, Aoying Zhou
ICPR
2008
IEEE
16 years 27 days ago
On efficient Viterbi decoding for hidden semi-Markov models
We present algorithms for improved Viterbi decoding for the case of hidden semi-Markov models. By carefully constructing directed acyclic graphs, we pose the decoding problem as t...
Bonnie K. Ray, Jianying Hu, Ritendra Datta
INFORMATIKTAGE
2008
15 years 1 months ago
An Energy-Efficient Routing Protocol for Linear Wireless Sensor Networks
: Economical power use is essential to allow for long-lasting operation of wireless sensor networks. This applies equally to linear sensor networks as they emerge when sensors are ...
Marco Zimmerling
WSC
1997
15 years 1 months ago
On the Efficiency of the Splitting and Roulette Approach for Sensitivity Analysis
The paper is devoted to a brief review of a mathematical theory for the branching variance-reduction technique. The branching technique is an extension of von Neumann’s splittin...
Viatcheslav B. Melas