4372 search results - page 116 / 875 » Algorithmic Theories of Everything |
106
Voted
GEM
2009
14 years 10 months ago
2009
- This paper demonstrates that simple yet important characteristics of coevolution can occur in evolutionary algorithms when only a few conditions are met. We find that interaction...
85
Voted
ISSAC
2007
Springer
15 years 7 months ago
2007
Springer
A new randomized algorithm is presented for computing the characteristic polynomial of an n × n matrix over a field. Over a sufficiently large field the asymptotic expected com...
ICALP
2000
Springer
15 years 4 months ago
2000
Springer
Abstract. We obtain new results regarding the precise average bitcomplexity of five algorithms of a broad Euclidean type. We develop a general framework for analysis of algorithms,...
100
click to vote
COMPGEOM
2005
ACM
15 years 2 months ago
2005
ACM
We initiate the study of exact geometric algorithms that require limited storage and make only a small number of passes over the input. Fundamental problems such as lowdimensional...
140
Voted
ACST
2006
15 years 2 months ago
2006
Consider the problem of membership query for a given partially ordered set. We devise a greedy algorithm which can produce near-optimal search strategies. Rigorous analysis has be...