560 search results - page 31 / 112 » From Continuous to Discrete Games |
EVOW
2009
Springer
14 years 2 months ago
2009
Springer
The Learnable Evolution Model (LEM) involves alternating periods of optimization and learning, performa extremely well on a range of problems, a specialises in achieveing good resu...
ICDM
2007
IEEE
13 years 11 months ago
2007
IEEE
Data discretization is defined as a process of converting continuous data attribute values into a finite set of intervals with minimal loss of information. In this paper, we prove...
ICALP
2005
Springer
14 years 1 months ago
2005
Springer
In this paper we initiate the study of discrete random variables over domains. Our work is inspired by work of Daniele Varacca, who devised indexed valuations as models of probabi...
PAMI
2010
13 years 6 months ago
2010
—Representative surface reconstruction algorithms taking a gradient field as input enforces the integrability constraint in a discrete manner. While enforcing integrability allo...
DM
2002
13 years 7 months ago
2002
We consider a variation of the chip-firing game in a induced subgraph S of a graph G. Starting from a given chip configuration, if a vertex v has at least as many chips as its deg...