271
click to vote
TACAS
16 years 22 days ago
2004 Springer 
We present a method of deriving Craig interpolants from proofs in the quantifier-free theory of linear inequality and uninterpreted function symbols, and an interpolating theorem...
264
click to vote
ASIAN
16 years 24 days ago
2004 Springer
Abstract. This text is an informal review of several randomized algorithms that have appeared over the past two decades and have proved instrumental in extracting efficiently quant...
247
Voted
ASIAN
15 years 11 months ago
2004 Springer
This paper presents a line of research in genetic algorithms (GAs), called building-block identification. The building blocks (BBs) are common structures inferred from a set of sol...
246
click to vote
STOC
16 years 7 months ago
2004 ACM 
Abstract. In the late nineties, Erickson proved a remarkable lower bound on the decision tree complexity of one of the central problems of computational geometry: given n numbers, ...
243
click to vote
WAW
16 years 22 days ago
2004 Springer
We develop an algorithm to detect community structure in complex networks. The algorithm is based on spectral methods and takes into account weights and links orientations. Since t...
|
Algorithms