721 search results - page 41 / 145 » On Generators of Random Quasigroup Problems |
137
Voted
PDSE
1998
15 years 4 months ago
1998
The development of correct OO distributed software is a daunting task as soon as the distributed interactions are not trivial. This is due to the inherent complexity of distribute...
141
Voted
COLING
2010
14 years 9 months ago
2010
We study a novel shallow information extraction problem that involves extracting sentences of a given set of topic categories from medical forum data. Given a corpus of medical fo...
112
Voted
COCO
2003
Springer
15 years 8 months ago
2003
Springer
We study the complexity of building pseudorandom generators (PRGs) with logarithmic seed length from hard functions. We show that, starting from a function f : {0, 1}l → {0, 1} ...
140
Voted
AIPS
2007
15 years 5 months ago
2007
In this paper, we propose an extended local search framework to solve combinatorial optimization problems with data uncertainty. Our approach represents a major departure from sce...
115
Voted
EUROGP
2001
Springer
15 years 7 months ago
2001
Springer
Recent theory work has shown that a Genetic Program (GP) used to produce programs may have output that is bounded above by the GP itself [l]. This paper presents proofs that show t...