Sciweavers

1208 search results - page 54 / 242
» Uniform eventown problems
Sort
View
ECAL
1995
Springer
15 years 7 months ago
Orgy in the Computer: Multi-Parent Reproduction in Genetic Algorithms
In this paper we investigate the phenomenon of multi-parent reproduction, i.e. we study recombination mechanisms where an arbitrary n > 1 number of parents participate in creati...
A. E. Eiben, Cees H. M. van Kemenade, Joost N. Kok
158
Voted
DALT
2008
Springer
15 years 5 months ago
Model-Checking Strategic Ability and Knowledge of the Past of Communicating Coalitions
We propose a variant of alternating time temporal logic (ATL) with imperfect information, perfect recall, epistemic modalities for the past and strategies which are required to be ...
Dimitar P. Guelev, Catalin Dima
170
Voted
FLAIRS
2003
15 years 5 months ago
BUC Algorithm for Iceberg Cubes: Implementation and Sensitivity Analysis
The Iceberg-Cube problem restricts the computation of the data cube to only those group-by partitions satisfying a minimum threshold condition defined on a specified measure. In t...
George E. Nasr, Celine Badr
CORR
2008
Springer
103views Education» more  CORR 2008»
15 years 4 months ago
Generating Random Graphs with Large Girth
We present a simple and efficient algorithm for randomly generating simple graphs without small cycles. These graphs can be used to design high performance Low-Density Parity-Chec...
Mohsen Bayati, Andrea Montanari, Amin Saberi
DM
2006
91views more  DM 2006»
15 years 4 months ago
Fast perfect sampling from linear extensions
In this paper, we study the problem of sampling (exactly) uniformly from the set of linear extensions of an arbitrary partial order. Previous Markov chain techniques have yielded ...
Mark Huber