Sciweavers

2434 search results - page 2 / 487
» Algorithmic Randomness of Closed Sets
Sort
View
CORR
2010
Springer
43views Education» more  CORR 2010»
13 years 3 months ago
Effective Capacity and Randomness of Closed Sets
Douglas Cenzer, Paul Brodhead
ALGORITHMICA
2006
161views more  ALGORITHMICA 2006»
13 years 4 months ago
The Expected Size of the Rule k Dominating Set
Dai, Li, and Wu proposed Rule k, a localized approximation algorithm that attempts to find a small connected dominating set in a graph. In this paper we consider the "average...
Jennie C. Hansen, Eric Schmutz, Li Sheng
GECCO
2007
Springer
167views Optimization» more  GECCO 2007»
13 years 11 months ago
Evolution of adult male oral tract shapes for close and open vowels
In this paper, we describe an experiment to evolve oral tract (mouth) shapes for a set of vowels for two adult males. Target vowels were recorded in an acoustically anechoic room ...
David M. Howard, Andy M. Tyrrell, Crispin H. V. Co...
SDM
2009
SIAM
161views Data Mining» more  SDM 2009»
14 years 2 months ago
Polynomial-Delay and Polynomial-Space Algorithms for Mining Closed Sequences, Graphs, and Pictures in Accessible Set Systems.
In this paper, we study efficient closed pattern mining in a general framework of set systems, which are families of subsets ordered by set-inclusion with a certain structure, pro...
Hiroki Arimura, Takeaki Uno
JAIR
2010
153views more  JAIR 2010»
13 years 3 months ago
Algorithms for Closed Under Rational Behavior (CURB) Sets
We provide a series of algorithms demonstrating that solutions according to the fundamental game-theoretic solution concept of closed under rational behavior (CURB) sets in two-pl...
Michael Benisch, George B. Davis, Tuomas Sandholm