Sciweavers

2200 search results - page 222 / 440
» Bloch's Constant is Computable
Sort
View
DAIS
2003
15 years 8 months ago
Facilitating the Portability of User Applications in Grid Environments
Abstract. Grid computing promises the ability to connect geographically and organizationally distributed resources to increase eective computational power, resource utilization, a...
Paul Z. Kolano
CORR
2007
Springer
172views Education» more  CORR 2007»
15 years 6 months ago
A Data-Parallel Version of Aleph
This is to present work on modifying the Aleph ILP system so that it evaluates the hypothesised clauses in parallel by distributing the data-set among the nodes of a parallel or di...
Stasinos Konstantopoulos
CORR
2002
Springer
111views Education» more  CORR 2002»
15 years 6 months ago
The Fastest and Shortest Algorithm for All Well-Defined Problems
An algorithm M is described that solves any well-defined problem p as quickly as the fastest algorithm computing a solution to p, save for a factor of 5 and loworder additive term...
Marcus Hutter
SAC
2008
ACM
15 years 6 months ago
Publish/subscribe architecture for mobile ad hoc networks
Publish/Subscribe architectures have been widely studied and applied in wired networks. However, their deployment on mobile ad hoc networks still presents a lot of challenges. Thi...
Cristiano G. Rezende, Bruno P. S. Rocha, Antonio A...
SAGT
2010
Springer
181views Game Theory» more  SAGT 2010»
15 years 4 months ago
On the Complexity of Pareto-optimal Nash and Strong Equilibria
We consider the computational complexity of coalitional solution concepts in scenarios related to load balancing such as anonymous and congestion games. In congestion games, Paret...
Martin Hoefer, Alexander Skopalik