6315 search results - page 192 / 1263 » Approximating Solution Structure |
156
click to vote
IJCAI
2003
15 years 8 months ago
2003
The computation of the first complete approximations of game-theoretic optimal strategies for fullscale poker is addressed. Several abstraction techniques are combined to represe...
151
click to vote
CCCG
1993
15 years 7 months ago
1993
d abstract) Gunter Rotey Christian Schwarzz Jack Snoeyinkx The width of a set of n points in the plane is the smallest distance between two parallel lines that enclose the set. W...
201
click to vote
SIAMJO
2011
15 years 27 days ago
2011
In this paper we define semidefinite packing programs and describe an algorithm to approximately solve these problems. Semidefinite packing programs arise in many applications s...
265
click to vote
ICDE
2004
IEEE
16 years 7 months ago
2004
IEEE
Temporal aggregate queries retrieve summarized information about records with time-evolving attributes. Existing approaches have at least one of the following shortcomings: (i) th...
180
click to vote
ICPR
2008
IEEE
16 years 7 months ago
2008
IEEE
In this work we present a model that uses a Dirichlet Process (DP) with a dynamic spatial constraints to approximate a non-homogeneous hidden Markov model (NHMM). The coefficient ...