9842 search results - page 354 / 1969 » The Complexity of the Matching-Cut Problem |
142
click to vote
GECCO
2009
Springer
15 years 8 months ago
2009
Springer
Encouraging exploration, typically by preserving the diversity within the population, is one of the most common method to improve the behavior of evolutionary algorithms with dece...
148
Voted
CIAC
2010
Springer
15 years 7 months ago
2010
Springer
The study of simple stochastic games (SSGs) was initiated by Condon for analyzing the computational power of randomized space-bounded alternating Turing machines. The game is play...
140
click to vote
CSC
2006
2006
An Adaptive Method for Flow Simulation in Three-Dimensional Heterogeneous Discrete Fracture Networks
15 years 5 months ago
Natural fractured media are highly unpredictable because of existing complex structures at the fracture and at the network levels. Fractures are by themselves heterogeneous objects...
119
Voted
CORR
2007
Springer
15 years 4 months ago
2007
Springer
: We develop a multiresolution approach to the problem of polygonal curve approximation. We show theoretically and experimentally that, if the simplification algorithm A used betwe...
136
click to vote
TCOM
2010
14 years 10 months ago
2010
In this paper, we propose a new implementation of the Extended Min-Sum (EMS) decoder for non-binary LDPC codes. A particularity of the new algorithm is that it takes into accounts...