Sciweavers

406 search results - page 57 / 82
» Pseudorandomness and Combinatorial Constructions
Sort
View
GECCO
2010
Springer
169views Optimization» more  GECCO 2010»
14 years 27 days ago
Stochastic local search in continuous domains: questions to be answered when designing a novel algorithm
Several population-based methods (with origins in the world of evolutionary strategies and estimation-of-distribution algorithms) for black-box optimization in continuous domains ...
Petr Posik
EMNLP
2004
14 years 10 days ago
Object-Extraction and Question-Parsing using CCG
Accurate dependency recovery has recently been reported for a number of wide-coverage statistical parsers using Combinatory Categorial Grammar (CCG). However, overall figures give...
Stephen Clark, Mark Steedman, James R. Curran
CORR
2006
Springer
123views Education» more  CORR 2006»
13 years 11 months ago
Directed animals in the gas
In this paper, we revisit the enumeration of directed animals using gas models. We show that there exists a natural construction of random directed animals on any directed graph t...
Yvan Le Borgne, Jean-François Marckert
COMBINATORICS
2007
67views more  COMBINATORICS 2007»
13 years 11 months ago
Directed Animals and Gas Models Revisited
In this paper, we revisit the enumeration of directed animals using gas models. We show that there exists a natural construction of random directed animals on any directed graph t...
Yvan Le Borgne, Jean-François Marckert
JCT
2008
103views more  JCT 2008»
13 years 11 months ago
A bijective proof of Jackson's formula for the number of factorizations of a cycle
Factorizations of the cyclic permutation (1 2 . . . N) into two permutations with respectively n and m cycles, or, equivalently, unicellular bicolored maps with N edges and n whit...
Gilles Schaeffer, Ekaterina A. Vassilieva