Sciweavers

689 search results - page 129 / 138
» Graphical Models for Game Theory
Sort
View
SODA
2010
ACM
190views Algorithms» more  SODA 2010»
16 years 2 months ago
One-Counter Markov Decision Processes
We study the computational complexity of some central analysis problems for One-Counter Markov Decision Processes (OC-MDPs), a class of finitely-presented, countable-state MDPs. O...
Tomas Brazdil, Vaclav Brozek, Kousha Etessami, Ant...
156
Voted
ECAI
2004
Springer
15 years 10 months ago
Emergence of Complex Networks through Local Optimization
Abstract. The emergence of complex network structures of relationships between autonomous agents occurs in a wide range of distributed systems. Many researchers have proposed model...
Josep M. Pujol, Andreas Flache, Ramon Sangües...
SMA
2003
ACM
132views Solid Modeling» more  SMA 2003»
15 years 10 months ago
Tight cocone: a water-tight surface reconstructor
Surface reconstruction from unorganized sample points is an important problem in computer graphics, computer aided design, medical imaging and solid modeling. Recently a few algor...
Tamal K. Dey, Samrat Goswami
SAC
2009
ACM
15 years 11 months ago
Origami fold as algebraic graph rewriting
We formalize paper fold (origami) by graph rewriting. Origami construction is abstractly described by a rewriting sys), where O is the set of abstract origami’s and ary relation...
Tetsuo Ida, Hidekazu Takahashi
CEC
2007
IEEE
15 years 11 months ago
A Utile Function Optimizer
Abstract— We recast the problem of unconstrained continuous evolutionary optimization as inference in a fixed graphical model. This approach allows us to address several pervasi...
Christopher K. Monson, Kevin D. Seppi, James L. Ca...