3019 search results - page 57 / 604 » Approximating the Domatic Number |
103
click to vote
DCG
2000
14 years 11 months ago
2000
We consider the problem of approximating a polygonal chain C by another polygonal chain C whose vertices are constrained to be a subset of the set of vertices of C. The goal is to ...
113
click to vote
AAAI
2006
15 years 1 months ago
2006
Partially observable Markov decision processes (POMDPs) are an intuitive and general way to model sequential decision making problems under uncertainty. Unfortunately, even approx...
106
click to vote
ICML
2010
IEEE
15 years 27 days ago
2010
IEEE
Approximate dynamic programming has been used successfully in a large variety of domains, but it relies on a small set of provided approximation features to calculate solutions re...
114
click to vote
ESA
2005
Springer
15 years 5 months ago
2005
Springer
This paper investigates, for the first time in the literature, the approximation of min-max (regret) versions of classical problems like shortest path, minimum spanning tree, and ...
CORR
2010
Springer
14 years 12 months ago
2010
Springer
In this paper we propose an approximated structured prediction framework for large scale graphical models and derive message-passing algorithms for learning their parameters effic...