Sciweavers

234 search results - page 27 / 47
» Games and Capacities on Partitions
Sort
View
ATAL
2006
Springer
15 years 1 months ago
Learning to identify winning coalitions in the PAC model
We consider PAC learning of simple cooperative games, in which the coalitions are partitioned into "winning" and "losing" coalitions. We analyze the complexity...
Ariel D. Procaccia, Jeffrey S. Rosenschein
MMS
2000
14 years 9 months ago
Dynamic Quota-Based Admission Control with Sub-Rating in Multimedia Servers
An admission control algorithm for a multimedia server is responsible for determining if a new request can be accepted without violating the Quality of Service (QoS) requirements o...
Sheng-Tzong Cheng, Chi-Ming Chen, Ing-Ray Chen
CHARME
2005
Springer
94views Hardware» more  CHARME 2005»
15 years 3 months ago
Verifying Quantitative Properties Using Bound Functions
Abstract. We define and study a quantitative generalization of the traditional boolean framework of model-based specification and verification. In our setting, propositions have...
Arindam Chakrabarti, Krishnendu Chatterjee, Thomas...
DEBS
2009
ACM
15 years 4 months ago
Distributed event stream processing with non-deterministic finite automata
Efficient matching of incoming events to persistent queries is fundamental to event pattern matching, complex event processing, and publish/subscribe systems. Recent processing e...
Lars Brenna, Johannes Gehrke, Mingsheng Hong, Dag ...
80
Voted
CORR
2007
Springer
110views Education» more  CORR 2007»
14 years 9 months ago
Relations between random coding exponents and the statistical physics of random codes
The partition function pertaining to finite–temperature decoding of a (typical) randomly chosen code is known to have three types of behavior, corresponding to three phases in ...
Neri Merhav