2168 search results - page 131 / 434 » Randomized Algorithms and Complexity Theory |
126
click to vote
EUROCOLT
1995
Springer
15 years 6 months ago
1995
Springer
Limiting identification of r.e. indexes for r.e. languages (from a presentation of elements of the language) and limiting identification of programs for computable functions (fr...
120
click to vote
IJSYSC
2000
15 years 3 months ago
2000
The generation of complex entities with advantageous behaviours beyond our manual design capability requires long-term incremental evolution with continuing emergence. In this pap...
127
Voted
MICAI
2005
Springer
15 years 8 months ago
2005
Springer
Although undirected cycles in directed graphs of Bayesian belief networks have been thoroughly studied, little attention has so far been given to a systematic analysis of directed ...
122
Voted
STOC
2005
ACM
16 years 3 months ago
2005
ACM
We construct an efficient probabilistic algorithm that, given a finite set with a binary operation, tests if it is an abelian group. The distance used is an analogue of the edit d...
135
click to vote
SPAA
2010
ACM
15 years 8 months ago
2010
ACM
This paper presents the design and analysis of parallel approximation algorithms for facility-location problems, including NC and RNC algorithms for (metric) facility location, k-...