Sciweavers

552 search results - page 85 / 111
» Lower bounds for dynamic connectivity
Sort
View
IJRR
2002
143views more  IJRR 2002»
13 years 7 months ago
Persistent Passive Hopping and Juggling is Possible Even With Plastic Collisions
We describe simple one-dimensional models of passive (no energy input, no control), generally dissipative, vertical hopping and oneball juggling. The central observation is that i...
Anindya Chatterjee, R. Pratap, C. K. Reddy, Andy R...
INFOCOM
1997
IEEE
14 years 3 days ago
Collision Avoidance and Resolution Multiple Access with Transmission Groups
The CARMA-NTG protocol is presented and analyzed. CARMA-NTG dynamically divides the channel into cycles of variable length; each cycle consists of a contention period and a group-...
Rodrigo Garcés, J. J. Garcia-Luna-Aceves
TROB
2008
118views more  TROB 2008»
13 years 7 months ago
Connectedness Preserving Distributed Swarm Aggregation for Multiple Kinematic Robots
Abstract-- A distributed swarm aggregation algorithm is developed for a team of multiple kinematic agents. Specifically, each agent is assigned with a control law which is the sum ...
Dimos V. Dimarogonas, Kostas J. Kyriakopoulos
STOC
1999
ACM
101views Algorithms» more  STOC 1999»
14 years 6 days ago
Short Proofs are Narrow - Resolution Made Simple
The width of a Resolution proof is defined to be the maximal number of literals in any clause of the proof. In this paper, we relate proof width to proof length (ϭsize), in both g...
Eli Ben-Sasson, Avi Wigderson
ANCS
2007
ACM
13 years 12 months ago
An improved algorithm to accelerate regular expression evaluation
Modern network intrusion detection systems need to perform regular expression matching at line rate in order to detect the occurrence of critical patterns in packet payloads. Whil...
Michela Becchi, Patrick Crowley