4894 search results - page 253 / 979 » The Guarding Problem - Complexity and Approximation |
179
click to vote
ICML
1999
IEEE
16 years 7 months ago
1999
IEEE
: Numerical function approximation over a Boolean domain is a classical problem with wide application to data modeling tasks and various forms of learning. A great many function ap...
167
click to vote
ICML
1995
IEEE
16 years 7 months ago
1995
IEEE
The success ofreinforcement learninginpractical problems depends on the ability to combine function approximation with temporal di erence methods such as value iteration. Experime...
171
click to vote
WINE
2007
Springer
16 years 21 days ago
2007
Springer
Abstract. We consider the problem of computing additively approximate Nash equilibria in non-cooperative two-player games. We provide a new polynomial time algorithm that achieves ...
214
click to vote
PDCAT
2005
Springer
16 years 2 days ago
2005
Springer
We consider the practical NP-complete problem of finding a minimum weight spanning tree with both edge weights and inner nodes weights. We present two polynomial time algorithms ...
185
click to vote
AAAI
2007
15 years 9 months ago
2007
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...