1058 search results - page 205 / 212 » It's Doomed; We Can Prove It |
ICALP
2001
Springer
14 years 2 months ago
2001
Springer
We present a probabilistic algorithm that, given a connected graph G (represented by adjacency lists) of average degree d, with edge weights in the set {1, . . . , w}, and given a ...
PPSN
2000
Springer
14 years 1 months ago
2000
Springer
Abstract. We explore a new general-purpose heuristic for nding highquality solutions to hard optimization problems. The method, called extremal optimization, is inspired by self-or...
IJCAI
1997
13 years 11 months ago
1997
We study the problemof statisticallycorrect inference in networks whose basic representations are population codes. Population codes are ubiquitous in the brain, and involve the s...
LPAR
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. The paper presents the methodology and the results of checking consistency of the knowledge base of CADIAG-2, a large-scale medical expert system. Such knowledge base con...
COCOA
2010
Springer
13 years 7 months ago
2010
Springer
The classical and well-studied group testing problem is to find d defectives in a set of n elements by group tests, which tell us for any chosen subset whether it contains defectiv...