159 search results - page 15 / 32 » Computing minimum cuts by randomized search heuristics |
97
Voted
NETWORKS
2010
14 years 10 months ago
2010
Let G = (V, E, Q) be a undirected graph, where V is the set of vertices, E is the set of edges, and Q = {Q1, . . . , Qq} is a partition of V into q subsets. We refer to Q1, . . . ...
77
Voted
CAD
1998
Springer
15 years 3 days ago
1998
Springer
Abstract. This paper presents two automatic fairing algorithms for parametric C2 -continuous bi-cubic B-spline surfaces. The fairing method consists of a knot removal and knot rein...
STOC
2004
ACM
16 years 21 days ago
2004
ACM
The problem of finding a local minimum of a black-box function is central for understanding local search as well as quantum adiabatic algorithms. For functions on the Boolean hype...
100
Voted
OOPSLA
2005
Springer
15 years 5 months ago
2005
Springer
Grammatical inference (or grammar inference) has been applied to various problems in areas such as computational biology, and speech and pattern recognition but its application to...
92
Voted
ALENEX
2001
15 years 1 months ago
2001
The purpose of this paper is to provide a preliminary report on the rst broad-based experimental comparison of modern heuristics for the asymmetric traveling salesmen problem ATSP....