1686 search results - page 201 / 338 » Programs as polygraphs: computability and complexity |
125
click to vote
EUROPAR
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Transactional memory systems trade ease of programming with runtime performance losses in handling transactions. This paper focuses on starvation effects that show up in ...
134
click to vote
ICALP
2007
Springer
15 years 10 months ago
2007
Springer
We consider the problem of constructing efficient locally decodable codes in the presence of a computationally bounded adversary. Assuming the existence of one-way functions, we c...
148
click to vote
ICN
2007
Springer
15 years 10 months ago
2007
Springer
— In this paper, we use the Markov Decision Process (MDP) technique to find the optimal code allocation policy in High-Speed Downlink Packet Access (HSDPA) networks. A discrete ...
118
click to vote
CLUSTER
2006
IEEE
15 years 10 months ago
2006
IEEE
One of the topics of paramount importance in the development of Cluster and Grid middleware is the impact of faults since their occurrence in Grid infrastructures and in large-sca...
174
click to vote
GLOBECOM
2006
IEEE
15 years 10 months ago
2006
IEEE
— A non-parametric, low-complexity algorithm for accurate and simultaneous localization of multiple sensors from scarce and imperfect ranging information is proposed. The techniq...