6105 search results - page 347 / 1221 » A Parallel Algorithm for Bound-Smoothing |
171
click to vote
ISCOPE
1999
Springer
15 years 11 months ago
1999
Springer
Fill-reducing sparse matrix orderings have been a topic of active research for many years. Although most such algorithms are developed and analyzed within a graph-theoretical frame...
148
click to vote
PPSN
1998
Springer
15 years 11 months ago
1998
Springer
Abstract. In order to escape from local optima, it is standard practice to periodically restart a genetic algorithm according to some restart criteria/policy. This paper addresses ...
157
click to vote
ICPP
1989
IEEE
15 years 10 months ago
1989
IEEE
Efficient hypercube algorithms are developed for the following image transformations: shrinking, expanding, translation, rotation, and scaling. A 2k −step shrinking and expandi...
186
click to vote
CIAC
2006
Springer
15 years 10 months ago
2006
Springer
In the rectangle stabbing problem we are given a set of axis parallel rectangles and a set of horizontal and vertical lines, and our goal is to find a minimum size subset of lines...
193
click to vote
PPSN
1998
Springer
15 years 10 months ago
1998
Springer
The production of specimen for microsystems or microcomponents is both, time and material-consuming. In a traditional design process the number of possible variations which can be ...