Sciweavers

128 search results - page 12 / 26
» Applying IC-Scheduling Theory to Familiar Classes of Computa...
Sort
View
WABI
2005
Springer
132views Bioinformatics» more  WABI 2005»
14 years 26 days ago
Perfect Sorting by Reversals Is Not Always Difficult
—We propose new algorithms for computing pairwise rearrangement scenarios that conserve the combinatorial structure of genomes. More precisely, we investigate the problem of sort...
Sèverine Bérard, Anne Bergeron, Cedr...
ISTCS
1997
Springer
13 years 11 months ago
Learning with Queries Corrupted by Classification Noise
Kearns introduced the "statistical query" (SQ) model as a general method for producing learning algorithms which are robust against classification noise. We extend this ...
Jeffrey C. Jackson, Eli Shamir, Clara Shwartzman
CMSB
2008
Springer
13 years 9 months ago
A Model Checking Approach to the Parameter Estimation of Biochemical Pathways
Model checking has historically been an important tool to verify models of a wide variety of systems. Typically a model has to exhibit certain properties to be classed `acceptable&...
Robin Donaldson, David Gilbert
GECCO
2007
Springer
124views Optimization» more  GECCO 2007»
13 years 11 months ago
Fitness-proportional negative slope coefficient as a hardness measure for genetic algorithms
The Negative Slope Coefficient (nsc) is an empirical measure of problem hardness based on the analysis of offspring-fitness vs. parent-fitness scatterplots. The nsc has been teste...
Riccardo Poli, Leonardo Vanneschi
CIE
2005
Springer
14 years 28 days ago
Some Reducibilities on Regular Sets
Abstract. We discuss some known and introduce some new reducibilities on regular sets. We establish some facts on the corresponding degree structures and relate some reducibilities...
Victor L. Selivanov