Sciweavers

3875 search results - page 297 / 775
» Approximation algorithms for the 0-extension problem
Sort
View
AAAI
2007
15 years 9 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
UAI
2008
15 years 8 months ago
Dyna-Style Planning with Linear Function Approximation and Prioritized Sweeping
We consider the problem of efficiently learning optimal control policies and value functions over large state spaces in an online setting in which estimates must be available afte...
Richard S. Sutton, Csaba Szepesvári, Alborz...
SECON
2010
IEEE
15 years 4 months ago
Transmission Scheduling for Routing Paths in Cognitive Radio Mesh Networks
Nodes in a cognitive radio mesh network may select from a set of available channels to use provided they do not interfere with primary users. This ability can improve overall netwo...
Brendan Mumey, Xia Zhao, Jian Tang, Richard S. Wol...
SWAT
2004
Springer
117views Algorithms» more  SWAT 2004»
16 years 3 days ago
Maximizing the Number of Packed Rectangles
Given a set of rectangles we are asked to pack as many of them as possible into a bigger rectangle. The rectangles packed may not overlap and may not be rotated. This problem is NP...
Klaus Jansen, Guochuan Zhang
ESANN
2004
15 years 8 months ago
High-accuracy value-function approximation with neural networks applied to the acrobot
Several reinforcement-learning techniques have already been applied to the Acrobot control problem, using linear function approximators to estimate the value function. In this pape...
Rémi Coulom