Sciweavers

2430 search results - page 293 / 486
» Computing Tutte Polynomials
Sort
View
128
Voted
CIS
2004
Springer
15 years 9 months ago
Algorithms for Loosely Constrained Multiple Sequence Alignment
For finding accurate and biologically meaningful multiple sequence alignment, it is required to consider a loosely constrained version of multiple sequence alignment. This paper is...
Bin Song, Fengfeng Zhou, Guoliang Chen
104
Voted
CONCUR
2004
Springer
15 years 9 months ago
Model Checking Timed Automata with One or Two Clocks
In this paper, we study model checking of timed automata (TAs), and more precisely we aim at finding efficient model checking for subclasses of TAs. For this, we consider model ch...
François Laroussinie, Nicolas Markey, Ph. S...
108
Voted
CPAIOR
2004
Springer
15 years 9 months ago
Cost Evaluation of Soft Global Constraints
This paper shows that existing definitions of costs associated with soft global constraints are not sufficient to deal with all the usual global constraints. We propose more expre...
Nicolas Beldiceanu, Thierry Petit
117
Voted
FSTTCS
2004
Springer
15 years 9 months ago
Testing Geometric Convexity
We consider the problem of determining whether a given set S in Rn is approximately convex, i.e., if there is a convex set K ∈ Rn such that the volume of their symmetric differe...
Luis Rademacher, Santosh Vempala
140
Voted
GECCO
2004
Springer
100views Optimization» more  GECCO 2004»
15 years 9 months ago
Analysis of the (1+1) EA for a Noisy OneMax
Abstract. In practical applications evaluating a fitness function is frequently subject to noise, i. e., the “true fitness” is disturbed by some random variations. Evolutiona...
Stefan Droste