Sciweavers

1434 search results - page 121 / 287
» Stochastic computation
Sort
View
JCDL
2010
ACM
151views Education» more  JCDL 2010»
14 years 12 months ago
Domain-specific iterative readability computation
We present a new algorithm to measure domain-specific readability. It iteratively computes the readability of domainspecific resources based on the difficulty of domain-specific c...
Jin Zhao, Min-Yen Kan
AAAI
2000
14 years 11 months ago
Deliberation in Equilibrium: Bargaining in Computationally Complex Problems
We develop a normative theory of interaction-negotiation in particular--among self-interested computationally limited agents where computational actions are game-theoretically tre...
Kate Larson, Tuomas Sandholm
CG
2006
Springer
15 years 1 months ago
Monte-Carlo Proof-Number Search for Computer Go
In the last decade, proof-number search and Monte-Carlo methods have successfully been applied to the combinatorial-games domain. Proof-number search is a reliable algorithm. It re...
Jahn-Takeshi Saito, Guillaume Chaslot, Jos W. H. M...
ICC
2008
IEEE
118views Communications» more  ICC 2008»
15 years 4 months ago
Bounded-Variance Network Calculus: Computation of Tight Approximations of End-to-End Delay
Abstract ⎯ Currently, the most advanced framework for stochastic network calculus is the min-plus algebra, providing bounds for the end-to-end delay in networks. The bounds calcu...
Paolo Giacomazzi, Gabriella Saddemi
MSWIM
2006
ACM
15 years 4 months ago
Performance modeling of critical event management for ubiquitous computing applications
A generic theoretical framework for managing critical events in ubiquitous computing systems is presented. The main idea is to automatically respond to occurrences of critical eve...
Tridib Mukherjee, Krishna M. Venkatasubramanian, S...