Sciweavers

1969 search results - page 84 / 394
» Financial Theory 1
Sort
View
CVPR
2012
IEEE
11 years 11 months ago
A game-theoretic approach to deformable shape matching
We consider the problem of minimum distortion intrinsic correspondence between deformable shapes, many useful formulations of which give rise to the NP-hard quadratic assignment p...
Emanuele Rodolà, Alexander M. Bronstein, An...
AAAI
2012
11 years 11 months ago
Computing Optimal Strategies to Commit to in Stochastic Games
Significant progress has been made recently in the following two lines of research in the intersection of AI and game theory: (1) the computation of optimal strategies to commit ...
Joshua Letchford, Liam MacDermed, Vincent Conitzer...
JGT
2007
130views more  JGT 2007»
13 years 8 months ago
Vertex partitions and maximum degenerate subgraphs
: Let G be a graph with maximum degree d ≥ 3 and ω(G) ≤ d, where ω(G) is the clique number of the graph G. Let p1 and p2 be two positive integers such that d = p1 + p2. In th...
Martín Matamala
APPROX
2006
Springer
162views Algorithms» more  APPROX 2006»
14 years 21 days ago
Approximating Precedence-Constrained Single Machine Scheduling by Coloring
Abstract. This paper investigates the relationship between the dimension theory of partial orders and the problem of scheduling precedenceconstrained jobs on a single machine to mi...
Christoph Ambühl, Monaldo Mastrolilli, Ola Sv...
GLVLSI
2005
IEEE
97views VLSI» more  GLVLSI 2005»
14 years 2 months ago
On equivalence checking and logic synthesis of circuits with a common specification
In this paper we develop a theory of equivalence checking (EC) and logic synthesis of circuits with a common specification (CS). We show that two combinational circuits N1, N2 have...
Eugene Goldberg