Sciweavers

4451 search results - page 356 / 891
» On Random Ordering Constraints
Sort
View
ICC
2008
IEEE
100views Communications» more  ICC 2008»
16 years 1 months ago
Discrete-Time Frequency-Selective Rayleigh Fading Channel --- Impact of Correlated Scattering on Outage and Ergodic Capacity
Abstract— We consider a discrete-time frequencyselective block-fading channel with Rayleigh fading and correlated scattering. This is relevant in the area of UWB and if transceiv...
Christian Müller, Martin Mittelbach
IROS
2008
IEEE
121views Robotics» more  IROS 2008»
16 years 1 months ago
Online ZMP sampling search for biped walking planning
— In this paper, we present a new method that uses random search for online planning of biped walking, given a feasible footstep plan. The Linear Inverted Pendulum dynamic model ...
Jinsu Liu, Manuela M. Veloso
ASIAMS
2007
IEEE
16 years 1 months ago
Solving Shortest Capacitated Path Problem Using a Bi-Objective Heuristic Approach
The shortest capacitated path problem is a well known problem in the networking area, having a wide range of applications. In the shortest capacitated path problem, a traffic flow...
Crina Grosan, Ajith Abraham
ICC
2007
IEEE
157views Communications» more  ICC 2007»
16 years 1 months ago
Secure Aggregation in Sensor Networks Using Neighborhood Watch
Abstract— Many sensor networks (SN) use in-network aggregation to minimize the amount of data transmitted by sensors. Unfortunately, aggregation makes the network more vulnerable...
Paul Rabinovich, Robert Simon
148
Voted
ICRA
2007
IEEE
156views Robotics» more  ICRA 2007»
16 years 1 months ago
Multipartite RRTs for Rapid Replanning in Dynamic Environments
Abstract— The Rapidly-exploring Random Tree (RRT) algorithm has found widespread use in the field of robot motion planning because it provides a single-shot, probabilistically c...
Matthew Zucker, James J. Kuffner, Michael S. Brani...