Sciweavers

4276 search results - page 793 / 856
» Computability of Probability Distributions and Distribution ...
Sort
View
127
Voted
MST
2002
152views more  MST 2002»
15 years 3 months ago
Average-Case Analysis of Greedy Packet Scheduling
We study the average number of delays suffered by packets routed using greedy (work conserving) scheduling policies. We obtain tight bounds on the worst-case average number of del...
Zvi Lotker, Boaz Patt-Shamir
120
Voted
TCAD
2002
134views more  TCAD 2002»
15 years 3 months ago
DS-LFSR: a BIST TPG for low switching activity
A test pattern generator (TPG) for built-in self-test (BIST), which can reduce switching activity during test application, is proposed. The proposed TPG, called dual-speed LFSR (DS...
Seongmoon Wang, Sandeep K. Gupta
118
Voted
ICRA
2010
IEEE
154views Robotics» more  ICRA 2010»
15 years 2 months ago
Multi-agent path planning with multiple tasks and distance constraints
— The DPC algorithm developed in our previous work is an efficient way of computing optimal trajectories for multiple robots in a distributed fashion with timeparameterized cons...
Subhrajit Bhattacharya, Maxim Likhachev, Vijay Kum...
129
Voted
ICRA
2010
IEEE
149views Robotics» more  ICRA 2010»
15 years 2 months ago
Towards simplicial coverage repair for mobile robot teams
— In this note, we present initial results towards developing a distributed algorithm for repairing topological holes in the sensor cover of a mobile robot team. Central to our a...
Jason C. Derenick, Vijay Kumar, Ali Jadbabaie
133
Voted
SAGT
2010
Springer
175views Game Theory» more  SAGT 2010»
15 years 2 months ago
On Learning Algorithms for Nash Equilibria
Can learning algorithms find a Nash equilibrium? This is a natural question for several reasons. Learning algorithms resemble the behavior of players in many naturally arising gam...
Constantinos Daskalakis, Rafael Frongillo, Christo...