Sciweavers

523 search results - page 25 / 105
» On the Signal Bounding Problem in Timing Analysis
Sort
View
DMTCS
2010
146views Mathematics» more  DMTCS 2010»
14 years 9 months ago
Tight Bounds for Delay-Sensitive Aggregation
This paper studies the fundamental trade-off between communication cost and delay cost arising in various contexts such as control message aggregation or organization theory. An o...
Yvonne Anne Pignolet, Stefan Schmid, Roger Wattenh...
GECCO
2005
Springer
151views Optimization» more  GECCO 2005»
15 years 5 months ago
The application of antigenic search techniques to time series forecasting
Time series have been a major topic of interest and analysis for hundreds of years, with forecasting a central problem. A large body of analysis techniques has been developed, par...
Ian Nunn, Tony White
SODA
2008
ACM
108views Algorithms» more  SODA 2008»
15 years 1 months ago
Price based protocols for fair resource allocation: convergence time analysis and extension to Leontief utilities
We analyze several distributed, continuous time protocols for a fair allocation of bandwidths to flows in a network (or resources to agents). Our protocols converge to an allocati...
Ashish Goel, Hamid Nazerzadeh
ICRA
2009
IEEE
92views Robotics» more  ICRA 2009»
15 years 6 months ago
I-Bug: An intensity-based bug algorithm
— This paper introduces a sensor-based planning algorithm that uses less sensing information than any others within the family of bug algorithms. The robot is unable to access pr...
Kamilah Taylor, Steven M. LaValle
STOC
1996
ACM
115views Algorithms» more  STOC 1996»
15 years 3 months ago
Minimum Cuts in Near-Linear Time
We significantly improve known time bounds for solving the minimum cut problem on undirected graphs. We use a "semiduality" between minimum cuts and maximum spanning tree...
David R. Karger