Sciweavers

121 search results - page 14 / 25
» A technique for generic iteration and its optimization
Sort
View
CADE
2009
Springer
14 years 8 months ago
Efficient Intuitionistic Theorem Proving with the Polarized Inverse Method
The inverse method is a generic proof search procedure applicable to non-classical logics satisfying cut elimination and the subformula property. In this paper we describe a genera...
Sean McLaughlin, Frank Pfenning
CP
2004
Springer
14 years 27 days ago
Constraint-Based Combinators for Local Search
Abstract. One of the most appealing features of constraint programming is its rich constraint language for expressing combinatorial optimization problems. This paper demonstrates t...
Pascal Van Hentenryck, Laurent Michel, Liyuan Liu
GECCO
2004
Springer
131views Optimization» more  GECCO 2004»
14 years 26 days ago
PolyEDA: Combining Estimation of Distribution Algorithms and Linear Inequality Constraints
Estimation of distribution algorithms (EDAs) are population-based heuristic search methods that use probabilistic models of good solutions to guide their search. When applied to co...
Jörn Grahl, Franz Rothlauf
VLDB
1997
ACM
124views Database» more  VLDB 1997»
13 years 11 months ago
An Efficient Cost-Driven Index Selection Tool for Microsoft SQL Server
In this paper we describe novel techniques that make it possible to build an industrial-strength tool for automating the choice of indexes in the physical design of a SQL database...
Surajit Chaudhuri, Vivek R. Narasayya
GECCO
2004
Springer
14 years 26 days ago
Metaheuristics for Natural Language Tagging
Abstract. This work compares different metaheuristics techniques applied to an important problem in natural language: tagging. Tagging amounts to assigning to each word in a text ...
Lourdes Araujo, Gabriel Luque, Enrique Alba