Sciweavers

243 search results - page 7 / 49
» How to Solve It Automatically: Selection Among Problem Solvi...
Sort
View
ACIIDS
2010
IEEE
172views Database» more  ACIIDS 2010»
15 years 2 months ago
Automatic Lexical Annotation Applied to the SCARLET Ontology Matcher
This paper proposes lexical annotation as an effective method to solve the ambiguity problems that affect ontology matchers. Lexical annotation associates to each ontology elemen...
Laura Po, Sonia Bergamaschi
AUSAI
2004
Springer
15 years 3 months ago
A New Neighborhood Based on Improvement Graph for Robust Graph Coloring Problem
In this paper, we propose a new neighborhood structure based on the improvement graph for solving the Robust Graph Coloring Problem, an interesting extension of classical graph col...
Songshan Guo, Ying Kong, Andrew Lim, Fan Wang
CPAIOR
2008
Springer
14 years 11 months ago
The Accuracy of Search Heuristics: An Empirical Study on Knapsack Problems
Theoretical models for the evaluation of quickly improving search strategies, like limited discrepancy search, are based on specific assumptions regarding the probability that a va...
Daniel H. Leventhal, Meinolf Sellmann
ICCS
2003
Springer
15 years 2 months ago
Self-Adapting Numerical Software and Automatic Tuning of Heuristics
Self-Adapting Numerical Software (SANS) systems aim to bridge the knowledge gap that exists between the expertise of domain scientists, and the know-how that is needed to fulfill...
Jack Dongarra, Victor Eijkhout
89
Voted
AAAI
2010
14 years 11 months ago
Automatic Derivation of Finite-State Machines for Behavior Control
Finite-state controllers represent an effective action selection mechanisms widely used in domains such as video-games and mobile robotics. In contrast to the policies obtained fr...
Blai Bonet, Héctor Palacios, Hector Geffner