5995 search results - page 240 / 1199 » Algorithmic Game Theory |
136
click to vote
SYNASC
2007
IEEE
15 years 11 months ago
2007
IEEE
In this technical report we present the proofs of properties appearing when solving the problem of prime decomposition of natural numbers using a scheme-based systematic exploratio...
150
click to vote
IJCAI
2003
15 years 6 months ago
2003
In this paper we propose the framework of Monte Carlo algorithms as a useful one to analyze ensemble learning. In particular, this framework allows one to guess when bagging will ...
179
click to vote
EC
1998
15 years 5 months ago
1998
L. M. Adleman launched the field of DNA computing with a demonstration in 1994 that strands of DNA could be used to solve the Hamiltonian path problem for a simple graph. He also...
122
click to vote
MOC
2002
15 years 5 months ago
2002
ABSTRACT. The aim of this paper is to provide a convergence analysis for a preconditioned subspace iteration, which is designated to determine a modest number of the smallest eigen...
153
click to vote
SIGCSE
2005
ACM
15 years 11 months ago
2005
ACM
The paper advocates a wider use of puzzles and puzzle-like games in teaching the analysis of algorithms. It discusses many specific examples—from classic puzzles of recreational...