Sciweavers

551 search results - page 80 / 111
» Natural proofs
Sort
View
SIGECOM
2006
ACM
143views ECommerce» more  SIGECOM 2006»
14 years 2 months ago
Braess's paradox in large random graphs
Braess’s Paradox is the counterintuitive but well-known fact that removing edges from a network with “selfish routing” can decrease the latency incurred by traffic in an eq...
Gregory Valiant, Tim Roughgarden
CRV
2005
IEEE
198views Robotics» more  CRV 2005»
14 years 2 months ago
Analysis of Player Actions in Selected Hockey Game Situations
We present a proof of concept system to represent and reason about hockey play. The system takes as input player motion trajectory data tracked from game video and supported by kn...
Fahong Li, Robert J. Woodham
ASIACRYPT
2005
Springer
14 years 2 months ago
Spreading Alerts Quietly and the Subgroup Escape Problem
We introduce a new cryptographic primitive called the blind coupon mechanism (BCM). In effect, the BCM is an authenticated bit commitment scheme, which is AND-homomorphic. It has n...
James Aspnes, Zoë Diamadi, Kristian Gjø...
ATAL
2005
Springer
14 years 2 months ago
Development of Self-organising Emergent Applications with Simulation-Based Numerical Analysis
The goal of engineering self-organising emergent systems is to acquire a macroscopic system behaviour solely from autonomous local activity and interaction. Due to the non-determin...
Tom De Wolf, Tom Holvoet, Giovanni Samaey
FOSSACS
2005
Springer
14 years 2 months ago
Composition and Decomposition in True-Concurrency
The idea of composition and decomposition to obtain computability results is particularly relevant for true-concurrency. In contrast to the interleaving world, where composition an...
Sibylle B. Fröschle