3946 search results - page 272 / 790 » The computational complexity of choice sets |
152
click to vote
DAC
1996
ACM
15 years 11 months ago
1996
ACM
In this paper we address the problem of code generation for basic blocks in heterogeneous memory-register DSP processors. We propose a new a technique, based on register-transfer ...
191
click to vote
FORMATS
2009
Springer
15 years 10 months ago
2009
Springer
Probabilistic timed automata (PTAs) are used for formal modelling and verification of systems with probabilistic, nondeterministic and real-time behaviour. For non-probabilistic ti...
140
click to vote
KR
2000
Springer
15 years 10 months ago
2000
Springer
We consider the two-fold problem of representing collective beliefs and aggregating these beliefs. We propose a novel representation for collective beliefs that uses modular, tran...
144
click to vote
CSE
2009
IEEE
15 years 10 months ago
2009
IEEE
Abstract--Web 2.0 users have many choices of contenthosting or application-service providers (CSPs). It can be difficult for a user to share content with a set of real-life friends...
180
click to vote
DSN
2005
IEEE
15 years 8 months ago
2005
IEEE
This paper describes an experiment performed on Wide Area Network to assess and fairly compare the Quality of Service provided by a large family of failure detectors. Failure dete...