Sciweavers

7796 search results - page 1181 / 1560
» On Generalized Schur Numbers
Sort
View
CN
1998
64views more  CN 1998»
15 years 7 months ago
Decentralized Network Connection Preemption Algorithms
Connection preemption provides available and reliable services to high-priority connections when a network is heavily loaded and connection request arrival patterns are unknown, o...
Mohammad Peyravian, Ajay D. Kshemkalyani
JAL
2002
113views more  JAL 2002»
15 years 7 months ago
A multivariate view of random bucket digital search trees
We take a multivariate view of digital search trees by studying the number of nodes of different types that may coexist in a bucket digital search tree as it grows under an arbitr...
Friedrich Hubalek, Hsien-Kuei Hwang, William Lew, ...
IDA
1998
Springer
15 years 7 months ago
Self-Organized-Expert Modular Network for Classification of Spatiotemporal Sequences
We investigate a form of modular neural network for classification with (a) pre-separated input vectors entering its specialist (expert) networks, (b) specialist networks which ar...
Sylvian R. Ray, William H. Hsu
INFORMS
1998
100views more  INFORMS 1998»
15 years 7 months ago
Feature Selection via Mathematical Programming
The problem of discriminating between two nite point sets in n-dimensional feature space by a separating plane that utilizes as few of the features as possible, is formulated as a...
Paul S. Bradley, Olvi L. Mangasarian, W. Nick Stre...
DATAMINE
1999
143views more  DATAMINE 1999»
15 years 7 months ago
Partitioning Nominal Attributes in Decision Trees
To find the optimal branching of a nominal attribute at a node in an L-ary decision tree, one is often forced to search over all possible L-ary partitions for the one that yields t...
Don Coppersmith, Se June Hong, Jonathan R. M. Hosk...
« Prev « First page 1181 / 1560 Last » Next »