Sciweavers

COMBINATORICS
2007
88views more  COMBINATORICS 2007»
13 years 4 months ago
Maximum Matchings in Regular Graphs of High Girth
Let G = (V, E) be any d-regular graph with girth g on n vertices, for d ≥ 3. This note shows that G has a maximum matching which includes all but an exponentially small fraction...
Abraham D. Flaxman, Shlomo Hoory
EUROGP
2006
Springer
112views Optimization» more  EUROGP 2006»
13 years 8 months ago
The Halting Probability in Von Neumann Architectures
Abstract. Theoretical models of Turing complete linear genetic programming (GP) programs suggest the fraction of halting programs is vanishingly small. Convergence results proved f...
William B. Langdon, Riccardo Poli
ICALP
2003
Springer
13 years 9 months ago
Degree Distribution of the FKP Network Model
Recently, Fabrikant, Koutsoupias and Papadimitriou [7] introduced a natural and beautifully simple model of network growth involving a trade-off between geometric and network obje...
Noam Berger, Béla Bollobás, Christia...
SIGECOM
2003
ACM
107views ECommerce» more  SIGECOM 2003»
13 years 9 months ago
Using value queries in combinatorial auctions
Combinatorial auctions, where bidders can bid on bundles of items are known to be desirable auction mechanisms for selling items that are complementary and/or substitutable. Howev...
Benoît Hudson, Tuomas Sandholm