Sciweavers

3422 search results - page 321 / 685
» Random Subset Optimization
Sort
View
ALGORITHMICA
2006
160views more  ALGORITHMICA 2006»
15 years 4 months ago
Combinatorial Algorithms for the Unsplittable Flow Problem
We provide combinatorial algorithms for the unsplittable flow problem (UFP) that either match or improve the previously best results. In the UFP we are given a (possibly directed)...
Yossi Azar, Oded Regev
IJON
2006
132views more  IJON 2006»
15 years 4 months ago
A binary neural decision table classifier
In this paper, we introduce a neural network -based decision table algorithm. We focus on the implementation details of the decision table algorithm when it is constructed using t...
Victoria J. Hodge, Simon O'Keefe, Jim Austin
AMAI
2002
Springer
15 years 4 months ago
Nonmonotonicity and Compatibility Relations in Belief Structures
: We concern ourselves with the situation Here we investigate an extension of the basic concept of in which we use the Dempster-Shafer belief structure to a compatibility relation ...
Ronald R. Yager
COMBINATORICS
2000
96views more  COMBINATORICS 2000»
15 years 4 months ago
Automorphisms and Enumeration of Switching Classes of Tournaments
Two tournaments T1 and T2 on the same vertex set X are said to be switching equivalent if X has a subset Y such that T2 arises from T1 by switching all arcs between Y and its comp...
László Babai, Peter J. Cameron
DAM
2000
137views more  DAM 2000»
15 years 4 months ago
Solving the feedback vertex set problem on undirected graphs
Feedback problems consist of removing a minimal number of vertices of a directed or undirected graph in order to make it acyclic. The problem is known to be NPcomplete. In this pa...
Lorenzo Brunetta, Francesco Maffioli, Marco Trubia...