2485 search results - page 143 / 497 » Time Bounded Frequency Computations |
145
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We propose a model for deterministic distributed function computation by a network of identical and anonymous nodes. In this model, each node has bounded computation and storage c...
180
click to vote
AI50
2006
15 years 10 months ago
2006
Computers have become an essential part of modern life, providing services in a multiplicity of ways. Access to these services, however, comes at a price: human attention is bound...
163
click to vote
AAAI
2004
15 years 7 months ago
2004
We consider from a computational perspective the problem of how to aggregate the ranking preferences of a number of alternatives by a number of different voters into a single cons...
353
click to vote
RTAS
2011
IEEE
14 years 10 months ago
2011
IEEE
—In this paper, we propose two adaptive scheduling approaches to support real-time control applications with highly varying computation times. The use of a resource reservation s...
196
click to vote
CPM
1994
Springer
15 years 10 months ago
1994
Springer
Recently, a new compact representation for suboptimal alignments was proposed by Naor and Brutlag (1993). The kernel of that representation is a minimal directed acyclic graph (DAG...