1026 search results - page 111 / 206 » On Finding Minimal w-cutset |
147
click to vote
EVOW
2006
Springer
15 years 10 months ago
2006
Springer
The k-cut problem is an NP-complete problem which consists of finding a partition of a graph into k balanced parts such that the number of cut edges is minimized. Different algori...
173
click to vote
ECAI
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. We call verification the process of finding the actual explanation of a given set of manifestations. We consider an abductive setting, in which explanations are sets of a...
159
click to vote
GECCO
2000
Springer
15 years 10 months ago
2000
Springer
We propose a new Genetic Algorithm (GA) for solving the minimum span frequency assignment problem (MSFAP). The MSFAP is minimizing the range of the frequencies assigned to each tr...
151
click to vote
CP
2008
Springer
15 years 8 months ago
2008
Springer
Constraints that are defined by tables of allowed tuples of assignments are common in constraint programming. In this paper we present an approach to reformulating table constraint...
159
click to vote
ESANN
2008
15 years 7 months ago
2008
Sequential Minimal Optimization (SMO) is currently the most popular algorithm to solve large quadratic programs for Support Vector Machine (SVM) training. For many variants of this...