Sciweavers

15782 search results - page 3149 / 3157
» Network Optimization and Control
Sort
View
INFORMS
1998
100views more  INFORMS 1998»
13 years 8 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...
MP
2002
85views more  MP 2002»
13 years 8 months ago
From fluid relaxations to practical algorithms for job shop scheduling: the makespan objective
We design an algorithm, called the fluid synchronization algorithm (FSA), for the job shop scheduling problem with the objective of minimizing the makespan. We round an optimal sol...
Dimitris Bertsimas, Jay Sethuraman
TC
1998
13 years 8 months ago
Algorithms for Variable Length Subnet Address Assignment
In a computer network that consists of M subnetworks, the L-bit address of a machine consists of two parts: A pre x si that contains the address of the subnetwork to which the mac...
Mikhail J. Atallah, Douglas Comer
TELSYS
2002
128views more  TELSYS 2002»
13 years 8 months ago
An Evaluation of Shared Multicast Trees with Multiple Cores
Native multicast routing protocols have been built and deployed using two basic types of trees: singlesource, shortest-path trees and shared, core-based trees. Core-based multicas...
Daniel Zappala, Aaron Fabbri, Virginia Mary Lo
WINET
2002
61views more  WINET 2002»
13 years 8 months ago
Multiple Working Points in Multichannel ALOHA with Deadlines
Abstract. This paper addresses the problem of maximizing the capacity of multichannel slotted ALOHA networks subject to a userspecified deadline and a permissible probability of ex...
Dror Baron, Yitzhak Birk
« Prev « First page 3149 / 3157 Last » Next »