Sciweavers

2370 search results - page 66 / 474
» The Characterization of Data-Accumulating Algorithms
Sort
View
INFOCOM
1996
IEEE
15 years 1 months ago
Network Algorithms and Protocol for Multimedia Servers
In this paper, we present a network service specifically designed for multimedia servers. It uses a histogram based traffic characterization and an overload control protocol to el...
Pawan Goyal, Harrick M. Vin
NIPS
2003
14 years 11 months ago
From Algorithmic to Subjective Randomness
We explore the phenomena of subjective randomness as a case study in understanding how people discover structure embedded in noise. We present a rational account of randomness per...
Thomas L. Griffiths, Joshua B. Tenenbaum
SCHEDULING
2008
97views more  SCHEDULING 2008»
14 years 9 months ago
Effective on-line algorithms for reliable due date quotation and large-scale scheduling
We consider the sequencing of a series of jobs that arrive at a single processor over time. At each job's arrival time, a due date must be quoted for the job, and the job must...
Philip Kaminsky, Zu-Hsu Lee
IPCO
2007
81views Optimization» more  IPCO 2007»
14 years 11 months ago
Matching Problems in Polymatroids Without Double Circuits
According to the present state of the theory of the matroid matching problem, the existence of a good characterization to the size of a maximum matching depends on the behavior of ...
Márton Makai, Gyula Pap, Jácint Szab...
CORR
2011
Springer
182views Education» more  CORR 2011»
14 years 4 months ago
Cyber-Physical Attacks in Power Networks: Models, Fundamental Limitations and Monitor Design
— Future power networks will be characterized by safe and reliable functionality against physical malfunctions and cyber attacks. This paper proposes a unified framework and adv...
Fabio Pasqualetti, Florian Dörfler, Francesco...