Sciweavers

75 search results - page 6 / 15
» Phase transition and heuristic search in relational learning
Sort
View
ICTAI
2006
IEEE
15 years 3 months ago
Efficient Search Using Bitboard Models
This paper shows a way to speed up search by using an encoding at bit level to model a particular domain. A bitboard is an unsigned integer whose bits have been given an interpret...
Pablo San Segundo, Ramón Galán, Fern...
AAAI
2012
12 years 12 months ago
Ontological Smoothing for Relation Extraction with Minimal Supervision
Relation extraction, the process of converting natural language text into structured knowledge, is increasingly important. Most successful techniques use supervised machine learni...
Congle Zhang, Raphael Hoffmann, Daniel S. Weld
GECCO
2007
Springer
167views Optimization» more  GECCO 2007»
15 years 3 months ago
Genetically designed heuristics for the bin packing problem
The bin packing problem (BPP) is a real-world problem that arises in different industrial applications related to minimization of space or time. The aim of this research is to au...
Oana Muntean
LPNMR
2007
Springer
15 years 3 months ago
On the Effectiveness of Looking Ahead in Search for Answer Sets
Abstract. Most complete answer set solvers are based on DPLL. One of the constraint propagation methods is the so-called lookahead, which has been somewhat controversial, due to it...
Guohua Liu, Jia-Huai You
GECCO
2007
Springer
558views Optimization» more  GECCO 2007»
15 years 3 months ago
A chain-model genetic algorithm for Bayesian network structure learning
Bayesian Networks are today used in various fields and domains due to their inherent ability to deal with uncertainty. Learning Bayesian Networks, however is an NP-Hard task [7]....
Ratiba Kabli, Frank Herrmann, John McCall