Sciweavers

3333 search results - page 97 / 667
» Abstract Proof Search
Sort
View
229
Voted
POPL
2008
ACM
16 years 3 months ago
Proving non-termination
The search for proof and the search for counterexamples (bugs) are complementary activities that need to be pursued concurrently in order to maximize the practical success rate of...
Ashutosh Gupta, Thomas A. Henzinger, Rupak Majumda...
147
Voted
CP
2005
Springer
15 years 9 months ago
2-Way vs. d-Way Branching for CSP
Abstract. Most CSP algorithms are based on refinements and extensions of backtracking, and employ one of two simple “branching schemes”: 2-way branching or d-way branching, fo...
Joey Hwang, David G. Mitchell
ICALP
2003
Springer
15 years 8 months ago
Similarity Matrices for Pairs of Graphs
Abstract. We introduce a concept of similarity between vertices of directed graphs. Let GA and GB be two directed graphs with respectively nA and nB vertices. We define a nA × nB...
Vincent D. Blondel, Paul Van Dooren
148
Voted
BMCBI
2008
111views more  BMCBI 2008»
15 years 3 months ago
SciDBMaker: new software for computer-aided design of specialized biological databases
Background: The exponential growth of research in molecular biology has brought concomitant proliferation of databases for stocking its findings. A variety of protein sequence dat...
Riadh Hammami, Abdelmajid Zouhir, Karim Naghmouchi...
103
Voted
ESWS
2008
Springer
15 years 5 months ago
Concept Search: Semantics Enabled Syntactic Search
Abstract. Historically, information retrieval (IR) has followed two principally different paths that we call syntactic IR and semantic IR. In syntactic IR, terms are represented as...
Fausto Giunchiglia, Uladzimir Kharkevich, Ilya Zai...