635 search results - page 38 / 127 » Some Computational Problems Related to Pseudo-intents |
FSTTCS
2001
Springer
15 years 2 months ago
2001
Springer
Semidefinite programming based approximation algorithms, such as the Goemans and Williamson approximation algorithm for the MAX CUT problem, are usually shown to have certain perf...
CSR
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. Ordering constraints are analogous to instances of the satisfiability problem in conjunctive normalform, but instead of a boolean assignment we consider a linear orderin...
MFCS
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. We devise an efficient protocol by which a series of twoperson games Gi with unique winning strategies can be combined into a single game G with unique winning strategy, ...
AAAI
2004
14 years 11 months ago
2004
The search for finite-state controllers for partially observable Markov decision processes (POMDPs) is often based on approaches like gradient ascent, attractive because of their ...
MVA
2000
14 years 11 months ago
2000
This paper explores the possibility of a linear model as a solution to the problem of appearance-based pose estimation. The parametric eigenspace method (or its extensions that ar...