Sciweavers

580 search results - page 27 / 116
» Approximation Algorithms for Temporal Reasoning
Sort
View
AAAI
2007
15 years 4 months ago
Partial Matchmaking using Approximate Subsumption
Description Logics, and in particular the web ontology language OWL has been proposed as an appropriate basis for computing matches between structured objects for the sake of info...
Heiner Stuckenschmidt
CISS
2008
IEEE
15 years 8 months ago
Distributed processing in frames for sparse approximation
—Beyond signal processing applications, frames are also powerful tools for modeling the sensing and information processing of many biological and man-made systems that exhibit in...
Christopher J. Rozell
NIPS
2001
15 years 3 months ago
Model-Free Least-Squares Policy Iteration
We propose a new approach to reinforcement learning which combines least squares function approximation with policy iteration. Our method is model-free and completely off policy. ...
Michail G. Lagoudakis, Ronald Parr
135
Voted
ESA
2001
Springer
145views Algorithms» more  ESA 2001»
15 years 6 months ago
Grouping Techniques for Scheduling Problems: Simpler and Faster
In this paper we describe a general grouping technique to devise faster and simpler approximation schemes for several scheduling problems. We illustrate the technique on two diff...
Aleksei V. Fishkin, Klaus Jansen, Monaldo Mastroli...
SEMWEB
2010
Springer
14 years 9 months ago
A reasonable Semantic Web
Abstract. The realization of Semantic Web reasoning is central to substantiating the Semantic Web vision. However, current mainstream research on this topic faces serious challenge...
Pascal Hitzler, Frank van Harmelen