Sciweavers

1112 search results - page 149 / 223
» Executing Abstract Test Cases
Sort
View
SPIRE
2005
Springer
15 years 5 months ago
Experimental Analysis of a Fast Intersection Algorithm for Sorted Sequences
Abstract. This work presents an experimental comparison of intersection algorithms for sorted sequences, including the recent algorithm of Baeza-Yates. This algorithm performs on a...
Ricardo A. Baeza-Yates, Alejandro Salinger
GECCO
2004
Springer
107views Optimization» more  GECCO 2004»
15 years 5 months ago
An Evolution Strategy Using a Continuous Version of the Gray-Code Neighbourhood Distribution
Abstract. We derive a continuous probability distribution which generates neighbours of a point in an interval in a similar way to the bitwise mutation of a Gray code binary string...
Jonathan E. Rowe, Dzena Hidovic
NLDB
2004
Springer
15 years 5 months ago
A Flexible Workbench for Document Analysis and Text Mining
Abstract: Document analysis and text mining techniques are used to preprocess documents in information retrieval systems, to extract concepts in ontology construction processes, an...
Jon Atle Gulla, Terje Brasethvik, Harald Kaada
SAT
2004
Springer
102views Hardware» more  SAT 2004»
15 years 5 months ago
Derandomization of Schuler's Algorithm for SAT
Abstract. Recently Schuler [17] presented a randomized algorithm that solves SAT in expected time at most 2n(1−1/ log2(2m)) up to a polynomial factor, where n and m are, respecti...
Evgeny Dantsin, Alexander Wolpert
CAV
2007
Springer
212views Hardware» more  CAV 2007»
15 years 3 months ago
A Tutorial on Satisfiability Modulo Theories
Abstract. Solvers for satisfiability modulo theories (SMT) check the satisfiability of first-order formulas containing operations from various theories such as the Booleans, bit-ve...
Leonardo Mendonça de Moura, Bruno Dutertre,...