Sciweavers

5 search results - page 1 / 1
» Relative-Order Abstractions for the Pancake Problem
Sort
View
ECAI
2010
Springer
13 years 12 months ago
Relative-Order Abstractions for the Pancake Problem
-Order Abstractions for the Pancake Problem Malte Helmert and Gabriele R
Malte Helmert, Gabriele Röger
JACM
2007
160views more  JACM 2007»
13 years 10 months ago
Lossless abstraction of imperfect information games
abstraction of imperfect information games ANDREW GILPIN and TUOMAS SANDHOLM Computer Science Department Carnegie Mellon University Pittsburgh, PA, USA Finding an equilibrium of an...
Andrew Gilpin, Tuomas Sandholm
CSR
2009
Springer
14 years 5 months ago
On Random Ordering Constraints
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...
Andreas Goerdt
ECCV
1994
Springer
15 years 21 days ago
Non-parametric Local Transforms for Computing Visual Correspondence
Abstract. We propose a new approach to the correspondence problem that makes use of non-parametric local transforms as the basis for correlation. Non-parametric local transforms re...
Ramin Zabih, John Woodfill
SIGECOM
2006
ACM
135views ECommerce» more  SIGECOM 2006»
14 years 4 months ago
Finding equilibria in large sequential games of imperfect information
Finding an equilibrium of an extensive form game of imperfect information is a fundamental problem in computational game theory, but current techniques do not scale to large games...
Andrew Gilpin, Tuomas Sandholm