Sciweavers

1927 search results - page 333 / 386
» UMDAs for dynamic optimization problems
Sort
View
116
Voted
ICDM
2002
IEEE
173views Data Mining» more  ICDM 2002»
15 years 5 months ago
Mining Genes in DNA Using GeneScout
In this paper, we present a new system, called GeneScout, for predicting gene structures in vertebrate genomic DNA. The system contains specially designed hidden Markov models (HM...
Michael M. Yin, Jason Tsong-Li Wang
IPPS
2002
IEEE
15 years 5 months ago
A High Performance Algorithm for Incompressible Flows Using Local Solenoidal Functions
The convergence of iterative methods used to solve the linear systems arising in incompressible flow problems is sensitive to flow parameters such as the Reynolds number, time s...
Sreekanth R. Sambavaram, Vivek Sarin
SPAA
1994
ACM
15 years 4 months ago
Bounds on the Greedy Routing Algorithm for Array Networks
We analyze the performance of greedy routing for array networks by providing bounds on the average delay and the average number of packets in the system for the dynamic routing pr...
Michael Mitzenmacher
97
Voted
EVOW
2006
Springer
15 years 4 months ago
On Interactive Evolution Strategies
Abstract. In this paper we discuss Evolution Strategies within the context of interactive optimization. Different modes of interaction will be classified and compared. A focus will...
Ron Breukelaar, Michael Emmerich, Thomas Bäck
CP
1995
Springer
15 years 4 months ago
Optimization-based Heuristics for Maximal Constraint Satisfaction
We present a new heuristic approach for maximal constraint satisfaction of overconstrained problems (MAX-CSP). This approach is based on a formulation of CSP as an optimization pro...
Javier Larrosa, Pedro Meseguer