6568 search results - page 1044 / 1314 » Reducing the Complexity of Reductions |
173
click to vote
ATAL
2007
Springer
16 years 26 days ago
2007
Springer
This paper addresses the problem of identifying the value of information held by a teammate on a distributed, multi-agent team. It focuses on a distributed scheduling task in whic...
158
click to vote
ATAL
2007
Springer
16 years 26 days ago
2007
Springer
This paper contributes to solve effectively stochastic resource allocation problems known to be NP-Complete. To address this complex resource management problem, a Qdecomposition...
155
click to vote
ATVA
2007
Springer
16 years 26 days ago
2007
Springer
Abstract. Bounded model checking (BMC) is a technique for overcoming the state explosion problem which has gained wide industrial acceptance. Bounded model checking is typically ap...
217
click to vote
CCS
2007
ACM
16 years 25 days ago
2007
ACM
Draw a secret (DAS) is a representative graphical password scheme. Rigorous theoretical analysis suggests that DAS supports an overall password space larger than that of the ubiqu...
188
click to vote
COREGRID
2007
Springer
16 years 25 days ago
2007
Springer
This paper deals with one of the fundamental properties of grid computing – transferring code between grid nodes and executing it remotely on heterogeneous hosts. Contemporary mi...