Sciweavers

4908 search results - page 75 / 982
» On the Complexity of Optimal K-Anonymity
Sort
View
IJCGA
2010
155views more  IJCGA 2010»
15 years 4 months ago
Competitive Complexity of Mobile Robot on-Line Motion Planning Problems
This paper is concerned with on-line problems where a mobile robot of size D has to achieve a task in an unknown planar environment whose geometry is acquired by the robot during ...
Yoav Gabriely, Elon Rimon
MP
2006
101views more  MP 2006»
15 years 6 months ago
Computational complexity of stochastic programming problems
Stochastic programming is the subfield of mathematical programming that considers optimization in the presence of uncertainty. During the last four decades a vast amount of litera...
Martin E. Dyer, Leen Stougie
CDC
2008
IEEE
168views Control Systems» more  CDC 2008»
16 years 20 days ago
An information-driven framework for motion planning in robotic sensor networks: Complexity and experiments
Abstract— A geometric optimization based approach to deploy a mobile sensor network for the purpose of detecting and capturing mobile targets in the plane is presented in [1]. Th...
Rafael Fierro, Silvia Ferrari, Chenghui Cai
GLOBECOM
2006
IEEE
16 years 7 days ago
Digital Complex Signal Processing Techniques for Impulse Radio
— This paper describes the digital complex signal processing techniques for a pulse-based UWB radio. The proposed baseband is essential to fully exploit the wideband signal chara...
Mike Shuo-Wei Chen, Robert W. Brodersen
CGF
2004
144views more  CGF 2004»
15 years 6 months ago
Crowd of Virtual Humans: a New Approach for Real Time Navigation in Complex and Structured Environments
The navigation activity is an every day practice for any human being capable of locomotion. Our objective in this work is to reproduce this crucial human activity inside virtual e...
Fabrice Lamarche, Stéphane Donikian