Sciweavers

220 search results - page 6 / 44
» Using Difference Reduction for Generic Proof Search
Sort
View
91
Voted
GECCO
2008
Springer
132views Optimization» more  GECCO 2008»
15 years 2 months ago
Subheuristic search and scalability in a hyperheuristic
Our previous work has introduced a hyperheuristic (HH) approach based on Genetic Programming (GP). There, GP employs usergiven languages where domain-specific local heuristics ar...
Robert E. Keller, Riccardo Poli
SIGIR
2002
ACM
15 years 24 days ago
Generic summarization and keyphrase extraction using mutual reinforcement principle and sentence clustering
A novel method for simultaneous keyphrase extraction and generic text summarization is proposed by modeling text documents as weighted undirected and weighted bipartite graphs. Sp...
Hongyuan Zha
93
Voted
CORR
2002
Springer
81views Education» more  CORR 2002»
15 years 29 days ago
Value withdrawal explanations: a theoretical tool for programming environments
Abstract. Constraint logic programming combines declarativity and efficiency thanks to constraint solvers implemented for specific domains. Value withdrawal explanations have been ...
Willy Lesaint
105
Voted
CSR
2010
Springer
15 years 6 months ago
Comparing Two Stochastic Local Search Algorithms for Constraint Satisfaction Problems
Abstract. In this survey we compare the similarities, differences and the complexities of two very different approaches to solve a general constraint satisfaction probblems (CSP). ...
Uwe Schöning
216
Voted
CADE
2011
Springer
14 years 1 months ago
Experimenting with Deduction Modulo
Deduction modulo is a generic framework to describe proofs in a theory better than using raw axioms. This is done by presenting the theory through rules rewriting terms and proposi...
Guillaume Burel