Sciweavers

506 search results - page 39 / 102
» Automated Search for Heuristic Functions
Sort
View
CADE
2006
Springer
14 years 8 months ago
Combining Type Theory and Untyped Set Theory
Abstract. We describe a second-order type theory with proof irrelevance. Within this framework, we give a representation of a form of Mac Lane set theory and discuss automated supp...
Chad E. Brown
GECCO
2004
Springer
118views Optimization» more  GECCO 2004»
14 years 1 months ago
Adapting Representation in Genetic Programming
Genetic Programming uses trees to represent chromosomes. The user defines the representation space by defining the set of functions and terminals to label the nodes in the trees....
Cezary Z. Janikow
HEURISTICS
2008
120views more  HEURISTICS 2008»
13 years 7 months ago
A local linear embedding module for evolutionary computation optimization
A Local Linear Embedding (LLE) module enhances the performance of two Evolutionary Computation (EC) algorithms employed as search tools in global optimization problems. The LLE em...
Fabio Boschetti
SIGMOD
2005
ACM
117views Database» more  SIGMOD 2005»
14 years 7 months ago
Relational data mapping in MIQIS
We demonstrate a prototype of the relational data mapping module of MIQIS, a formal framework for investigating information flow in peer-to-peer database management systems. Data ...
George H. L. Fletcher, Catharine M. Wyss
ECAI
2000
Springer
14 years 20 hour ago
Search Pruning Conditions for Boolean Optimization
This paper proposes new algorithms for the Binate Covering Problem (BCP), a well-known restriction of Boolean Optimization. Binate Covering finds application in many areas of Com...
Vasco M. Manquinho, João P. Marques Silva