1568 search results - page 133 / 314 » The problem of examination questions in algorithmics |
137
Voted
FOSAD
2000
Springer
15 years 8 months ago
2000
Springer
This material was presented in a series of lectures at fosad, a summer school on Foundations of Security Analysis and Design, at the University of Bologna Center at Bertinoro in Se...
148
Voted
TNN
1998
15 years 4 months ago
1998
—In this paper we examine a technique by which fault tolerance can be embedded into a feedforward network leading to a network tolerant to the loss of a node and its associated w...
126
click to vote
GECCO
2005
Springer
15 years 10 months ago
2005
Springer
When applied to optimization problems, Cooperative Coevolutionary Algorithms (CCEA) have been observed to exhibit a behavior called relative overgeneralization. Roughly, they tend...
167
click to vote
COMPGEOM
2011
ACM
14 years 8 months ago
2011
ACM
We consider the offset-deconstruction problem: Given a polygonal shape Q with n vertices, can it be expressed, up to a tolerance ε in Hausdorff distance, as the Minkowski sum o...
160
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
The edit distance problem is a classical fundamental problem in computer science in general, and in combinatorial pattern matching in particular. The standard dynamic programming s...