Sciweavers

7943 search results - page 94 / 1589
» A calculus for costed computations
Sort
View
66
Voted
GG
2008
Springer
14 years 11 months ago
Resolution-Like Theorem Proving for High-Level Conditions
The tautology problem is the problem to prove the validity of statements. In this paper, we present a calculus for this undecidable problem on graphical conditions, prove its sound...
Karl-Heinz Pennemann
DCC
1999
IEEE
14 years 10 months ago
A General Polynomial Sieve
An important component of the index calculus methods for finding discrete logarithms is the acquisition of smooth polynomial relations. Gordon and McCurley (1992) developed a sieve...
Shuhong Gao, Jason Howell
87
Voted
GECON
2009
Springer
113views Business» more  GECON 2009»
15 years 2 months ago
Cost Optimization Model for Business Applications in Virtualized Grid Environments
Abstract. The advent of Grid computing gives enterprises an ever increasing choice of computing options, yet research has so far hardly addressed the problem of mixing the differe...
Jörg Strebel
78
Voted
IPPS
1998
IEEE
15 years 2 months ago
Using the BSP Cost Model to Optimise Parallel Neural Network Training
We derive cost formulae for three di erent parallelisation techniques for training supervised networks. These formulae are parameterised by properties of the target computer archit...
R. O. Rogers, David B. Skillicorn
68
Voted
FCT
2007
Springer
15 years 4 months ago
Fast Asymptotic FPTAS for Packing Fragmentable Items with Costs
Hadas Shachnai, Omer Yehezkely