13752 search results - page 2330 / 2751 » Parallel and Distributed Haskells |
179
click to vote
COCO
2005
Springer
15 years 12 months ago
2005
Springer
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
196
click to vote
MIDDLEWARE
2004
Springer
15 years 11 months ago
2004
Springer
The characteristics of mobile environments, with the possibility of frequent disconnections and fluctuating bandwidth, have forced a rethink of traditional middleware. In particu...
183
click to vote
MIDDLEWARE
2004
Springer
15 years 11 months ago
2004
Springer
Application servers provide many functionalities commonly needed in the development of a complex distributed application. So far, the functionalities have mostly been developed an...
171
click to vote
EDOC
2003
IEEE
15 years 11 months ago
2003
IEEE
Distributed systems are inherently complex, and therefore difficult to design and develop. Experience shows that new technologies—such as components, aspects, and application f...
188
click to vote
WDAG
2001
Springer
15 years 10 months ago
2001
Springer
Abstract. The ability to cooperate on common tasks in a distributed setting is key to solving a broad range of computation problems ranging from distributed search such as SETI to ...