Sciweavers

1191 search results - page 81 / 239
» Completeness and Performance Of The APO Algorithm
Sort
View
TSMC
1998
169views more  TSMC 1998»
13 years 9 months ago
Real-time map building and navigation for autonomous robots in unknown environments
—An algorithmic solution method is presented for the problem of autonomous robot motion in completely unknown environments. Our approach is based on the alternate execution of tw...
Giuseppe Oriolo, Giovanni Ulivi, Marilena Venditte...
ICIP
2004
IEEE
14 years 11 months ago
Efficient path aggregation and error control for video streaming
This paper presents an efficient multiplexing and error control system to improve streaming video performance over path aggregates. While providing the application with increased ...
Omesh Tickoo, Shivkumar Kalyanaraman, John W. Wood...
HPCS
2009
IEEE
14 years 2 months ago
FFT-Based Dense Polynomial Arithmetic on Multi-cores
We report efficient implementation techniques for FFT-based dense multivariate polynomial arithmetic over finite fields, targeting multi-cores. We have extended a preliminary study...
Marc Moreno Maza, Yuzhen Xie
SPIN
2005
Springer
14 years 3 months ago
Repairing Structurally Complex Data
We present a novel algorithm for repairing structurally complex data. Given an assertion that represents desired structural integrity constraints and a structure that violates them...
Sarfraz Khurshid, Iván García, Yuk L...
FLAIRS
2006
13 years 11 months ago
Which Dynamic Constraint Problems Can Be Solved By Ants?
There exist a number of algorithms that can solve dynamic constraint satisfaction/optimization problems (DynCSPs or DynCOPs). Because of the large variety in the characteristics o...
Koenraad Mertens, Tom Holvoet, Yolande Berbers