Sciweavers

8413 search results - page 446 / 1683
» Ordering Problem Subgoals
Sort
View
SIGECOM
2006
ACM
135views ECommerce» more  SIGECOM 2006»
16 years 21 days 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
COCO
2004
Springer
79views Algorithms» more  COCO 2004»
15 years 10 months ago
Small Spans in Scaled Dimension
Juedes and Lutz (1995) proved a small span theorem for polynomial-time many-one reductions in exponential time. This result says that for language A decidable in exponential time,...
John M. Hitchcock
SODA
2003
ACM
167views Algorithms» more  SODA 2003»
15 years 8 months ago
Counting inversions in lists
In a recent paper, Ajtai et al. [1] give a streaming algorithm to count the number of inversions in a stream Ä ¾ Ñ Ò using two passes and Ç´¯ ½ ÔÒÐÓ Ò´ÐÓ Ñ·ÐÓ...
Anupam Gupta, Francis Zane
CORR
2006
Springer
135views Education» more  CORR 2006»
15 years 6 months ago
Classification of Ordinal Data
Many real life problems require the classification of items into naturally ordered classes. These problems are traditionally handled by conventional methods intended for the class...
Jaime S. Cardoso
ICPR
2008
IEEE
16 years 8 months ago
Supervised learning of a generative model for edge-weighted graphs
This paper addresses the problem of learning archetypal structural models from examples. To this end we define a generative model for graphs where the distribution of observed nod...
Andrea Torsello, David L. Dowe