Sciweavers

236 search results - page 13 / 48
» heuristics 2002
Sort
View
MOC
2002
109views more  MOC 2002»
14 years 9 months ago
The parallelized Pollard kangaroo method in real quadratic function fields
Abstract. We show how to use the parallelized kangaroo method for computing invariants in real quadratic function fields. Specifically, we show how to apply the kangaroo method to ...
Andreas Stein, Edlyn Teske
ML
2002
ACM
114views Machine Learning» more  ML 2002»
14 years 9 months ago
Building a Basic Block Instruction Scheduler with Reinforcement Learning and Rollouts
The execution order of a block of computer instructions on a pipelined machine can make a difference in running time by a factor of two or more. Compilers use heuristic schedulers...
Amy McGovern, J. Eliot B. Moss, Andrew G. Barto
STOC
2002
ACM
121views Algorithms» more  STOC 2002»
15 years 10 months ago
Almost all graphs with average degree 4 are 3-colorable
We analyze a randomized version of the Brelaz heuristic on sparse random graphs. We prove that almost all graphs with average degree dp4:03; i.e., G?n; p ? d=n?; are 3-colorable a...
Dimitris Achlioptas, Cristopher Moore
71
Voted
CRYPTO
2003
Springer
124views Cryptology» more  CRYPTO 2003»
15 years 2 months ago
Primality Proving via One Round in ECPP and One Iteration in AKS
On August 2002, Agrawal, Kayal and Saxena announced the first deterministic and polynomial time primality testing algorithm. For an input n, the AKS algorithm runs in heuristic t...
Qi Cheng
70
Voted
IPPS
2002
IEEE
15 years 2 months ago
Supporting Co-Allocation in an Auctioning-Based Resource Allocator for Grid Systems
In this paper, we present the overall design for an auctioning based resource trading/acquiring system that can be deployed in wide-area computing systems such as Grid systems. Se...
Chunming Chen, Muthucumaru Maheswaran, Michel Toul...