Sciweavers

3637 search results - page 570 / 728
» On Dynamic Bit-Probe Complexity
Sort
View
ICRA
2003
IEEE
125views Robotics» more  ICRA 2003»
15 years 11 months ago
Online footstep planning for humanoid robots
We present an online algorithm for planning sequences of footstep locations that encode goal-directed navigation strategies for humanoid robots. Planning footsteps is more general...
James J. Kuffner Jr., Satoshi Kagami, Koichi Nishi...
ICTAI
2003
IEEE
15 years 11 months ago
Approximate Discrete Probability Distribution Representation Using a Multi-Resolution Binary Tree
Computing and storing probabilities is a hard problem as soon as one has to deal with complex distributions over multiples random variables. The problem of efficient representati...
David Bellot, Pierre Bessière
INFOCOM
2003
IEEE
15 years 11 months ago
Interaction of TCP Flows as Billiards
Abstract— The aim of this paper is to analyze the performance of a large number of long lived TCP controlled flows sharing many routers (or links), from the knowledge of the net...
François Baccelli, Dohy Hong
INFOCOM
2003
IEEE
15 years 11 months ago
Network Design For Rate Adaptive Media Streams
— Rate adaptive multimedia streams offer significant system and client benefits over non-adaptive streams. These benefits come at the price of increased complexity in providin...
Steven Weber, Gustavo de Veciana
ISCC
2003
IEEE
122views Communications» more  ISCC 2003»
15 years 11 months ago
AMCA: an Active-based Multicast Congestion Avoidance Algorithm
Many works have recently addressed the issue of congestion control for multicast communications and the problem is known to be highly complex. Scalability, responsiveness, stabili...
Moufida Maimour, CongDuc Pham