12519 search results - page 378 / 2504 » Approximation Problems Categories |
266
click to vote
FOCS
2005
IEEE
16 years 1 months ago
2005
IEEE
At the core of the seminal Graph Minor Theory of Robertson and Seymour is a powerful structural theorem capturing the structure of graphs excluding a fixed minor. This result is ...
202
click to vote
ECML
2004
Springer
16 years 1 months ago
2004
Springer
Abstract. We present first experiments using Support Vector Regression as function approximator for an on-line, sarsa-like reinforcement learner. To overcome the batch nature of S...
211
click to vote
VMCAI
2004
Springer
16 years 28 days ago
2004
Springer
In this paper we deal with the problem of applying model checking to real programs. We verify a program without constructing the whole transition system using a technique based on...
191
click to vote
PODS
2010
ACM
16 years 20 days ago
2010
ACM
XML Schema Definitions (XSDs) can be adequately abstracted by the single-type regular tree languages. It is wellknown, that these form a strict subclass of the robust class of re...
213
click to vote
COMPGEOM
2000
ACM
15 years 12 months ago
2000
ACM
We present an (1+ε)-approximation algorithm for computing the minimum-spanning tree of points in a planar arrangement of lines, where the metric is the number of crossings betwee...