697 search results - page 35 / 140 » On the Theory of Average Case Complexity |
STOC
1996
ACM
13 years 12 months ago
1996
ACM
We use the Laplacian and power method to compute Betti numbers of simplicial complexes. This has a number of advantages over other methods, both in theory and in practice. It requ...
CHI
2007
ACM
14 years 8 months ago
2007
ACM
We present the case study of a complex, mixed-initiative scheduling system to illustrate Work-Centered Design (WCD), a new approach for the design of information systems. WCD is b...
COLT
2003
Springer
14 years 1 months ago
2003
Springer
We study on-line play of repeated matrix games in which the observations of past actions of the other player and the obtained reward are partial and stochastic. We define the Part...
RTAS
2008
IEEE
14 years 2 months ago
2008
IEEE
Real-time schedulability theory requires a priori knowledge of the worst-case execution time (WCET) of every task in the system. Fundamental to the calculation of WCET is a schedu...
CDC
2010
IEEE
13 years 2 months ago
2010
IEEE
In this paper we consider the problem of gossiping in a network to diffuse the average of a sub-set of nodes, called sources, and directing it to another sub-set of nodes in the ne...