Sciweavers

2626 search results - page 189 / 526
» The complexity of stochastic sequences
Sort
View
GECCO
1999
Springer
158views Optimization» more  GECCO 1999»
15 years 10 months ago
Coevolutionary Genetic Algorithms for Solving Dynamic Constraint Satisfaction Problems
In this paper, we discuss the adaptability of Coevolutionary Genetic Algorithms on dynamic environments. Our CGA consists of two populations: solution-level one and schema-level o...
Hisashi Handa, Osamu Katai, Tadataka Konishi, Mits...
CDC
2009
IEEE
156views Control Systems» more  CDC 2009»
15 years 10 months ago
Input design using Markov chains for system identification
This paper studies the input design problem for system identification where time domain constraints have to be considered. A finite Markov chain is used to model the input of the s...
Chiara Brighenti, Bo Wahlberg, Cristian R. Rojas
FPGA
2008
ACM
191views FPGA» more  FPGA 2008»
15 years 8 months ago
A hardware framework for the fast generation of multiple long-period random number streams
Stochastic simulations and other scientific applications that depend on random numbers are increasingly implemented in a parallelized manner in programmable logic. High-quality ps...
Ishaan L. Dalal, Deian Stefan
IPCO
2007
94views Optimization» more  IPCO 2007»
15 years 8 months ago
Infrastructure Leasing Problems
Consider the following Steiner Tree leasing problem. Given a graph G = (V, E) with root r, and a sequence of terminal sets Dt ⊆ V for each day t ∈ [T]. A feasible solution to t...
Barbara M. Anthony, Anupam Gupta
NIPS
2007
15 years 8 months ago
A Probabilistic Approach to Language Change
We present a probabilistic approach to language change in which word forms are represented by phoneme sequences that undergo stochastic edits along the branches of a phylogenetic ...
Alexandre Bouchard-Côté, Percy Liang,...