Sciweavers

1963 search results - page 56 / 393
» Applications of Preferences using Answer Set Programming
Sort
View
128
Voted
PLILP
1993
Springer
15 years 6 months ago
Narrowing Approximations as an Optimization for Equational Logic Programs
Abstract. Solving equations in equational theories is a relevant programming paradigm which integrates logic and equational programming into one unified framework. Efficient metho...
María Alpuente, Moreno Falaschi, Marí...
146
Voted
DLOG
2003
15 years 4 months ago
Incremental Query Answering for Implementing Document Retrieval Services
Agent systems that search the Semantic Web are seen as killer applications for description logic (DL) inference engines. The guiding examples for the Semantic Web involve informat...
Volker Haarslev, Ralf Möller
150
Voted
CORR
2006
Springer
153views Education» more  CORR 2006»
15 years 2 months ago
Genetic Programming, Validation Sets, and Parsimony Pressure
Fitness functions based on test cases are very common in Genetic Programming (GP). This process can be assimilated to a learning task, with the inference of models from a limited n...
Christian Gagné, Marc Schoenauer, Marc Pari...
100
Voted
PVM
2009
Springer
15 years 9 months ago
Optimizing MPI Runtime Parameter Settings by Using Machine Learning
Abstract. Manually tuning MPI runtime parameters is a practice commonly employed to optimise MPI application performance on a specific architecture. However, the best setting for ...
Simone Pellegrini, Jie Wang, Thomas Fahringer, Han...
123
Voted
AAAI
2006
15 years 4 months ago
On the Difficulty of Modular Reinforcement Learning for Real-World Partial Programming
In recent years there has been a great deal of interest in "modular reinforcement learning" (MRL). Typically, problems are decomposed into concurrent subgoals, allowing ...
Sooraj Bhat, Charles Lee Isbell Jr., Michael Matea...