Sciweavers

14548 search results - page 2488 / 2910
» The Optimal Path-Matching Problem
Sort
View
169
Voted
GECCO
2005
Springer
125views Optimization» more  GECCO 2005»
16 years 10 days ago
Schema disruption in tree-structured chromosomes
We study if and when the inequality dp(H) ≤ rel∆(H) holds for schemas H in chromosomes that are structured as trees. The disruption probability dp(H) is the probability that a...
William A. Greene
GECCO
2005
Springer
154views Optimization» more  GECCO 2005»
16 years 10 days ago
Combining competent crossover and mutation operators: a probabilistic model building approach
This paper presents an approach to combine competent crossover and mutation operators via probabilistic model building. Both operators are based on the probabilistic model buildin...
Cláudio F. Lima, Kumara Sastry, David E. Go...
GECCO
2005
Springer
124views Optimization» more  GECCO 2005»
16 years 10 days ago
Evolving petri nets to represent metabolic pathways
Given concentrations of metabolites over a sequence of time steps, the metabolic pathway prediction problem seeks a set of reactions and rate constants for them that could yield t...
Jeremiah Nummela, Bryant A. Julstrom
IPSN
2005
Springer
16 years 10 days ago
Adaptive statistical sampling methods for decentralized estimation and detection of localized phenomena
— Sensor networks (SNETs) for monitoring spatial phenomena has emerged as an area of significant practical interest. We focus on the important problem of detection of distribute...
Erhan Baki Ermis, Venkatesh Saligrama
PASTE
2004
ACM
16 years 7 days ago
Resolving and applying constraint queries on context-sensitive analyses
A context-sensitive analysis is an analysis in which program elements are assigned sets of properties that depend upon the context in which they occur. For analyses on imperative ...
James Ezick
« Prev « First page 2488 / 2910 Last » Next »