5995 search results - page 425 / 1199 » Algorithmic Game Theory |
220
click to vote
AAAI
2008
15 years 10 months ago
2008
Modern Bayesian Network learning algorithms are timeefficient, scalable and produce high-quality models; these algorithms feature prominently in decision support model development...
198
click to vote
GECCO
2008
Springer
15 years 8 months ago
2008
Springer
We study the minimum s-t-cut problem in graphs with costs on the edges in the context of evolutionary algorithms. Minimum cut problems belong to the class of basic network optimiz...
223
click to vote
WEA
2010
Springer
16 years 2 months ago
2010
Springer
This paper shows that using some very simple practical assumptions, one can design an algorithm that finds the nearest neighbor of a given query point in O(log n) time in theory ...
172
click to vote
ISAAC
2009
Springer
16 years 2 months ago
2009
Springer
Abstract. The theory of multidimensional persistence captures the topology of a multifiltration – a multiparameter family of increasing spaces. Multifiltrations arise naturally...
191
click to vote
CADE
1999
Springer
16 years 1 hour ago
1999
Springer
We reduce the provability problem of any formula of the Lambek calculus to some context-free parsing problem. This reduction, which is based on non-commutative proof-net theory, al...