Country: United States

Found 17049 papers in total
Performance analysis of a server for facsimile communication networks
Performance analysis of a server for facsimile communication networks
2001,
We present a performance analysis of a multiaddress call extraction server. The...
Queues and hierarchies
Queues and hierarchies
2001,
This paper examines the optimal structure of hierarchies when workers differ in the...
An aggregation approach to solving the network p-median problem with link demands
An aggregation approach to solving the network p-median problem with link demands
2000,
This paper considers the p -median problem on a general network with link demands. We...
Solving nonconvex planar location problems by finite dominating sets
Solving nonconvex planar location problems by finite dominating sets
2000,
It is well-known that some of the classical location problems with polyhedral gauges...
Two control policies for stochastic economic order quantity-type models
Two control policies for stochastic economic order quantity-type models
2001,
We present the production version of two EOQ-type models in heavy traffic. The output...
A data envelopment analysis framework to assess the efficiency of the software requirements capture and analysis process
A data envelopment analysis framework to assess the efficiency of the software requirements capture and analysis process
1999,
In this paper a theoretical framework to assess the efficiency of the Requirements...
Priority queues and multisets
Priority queues and multisets
1995,
A priority queue, a container data structure equipped with the operations insert and...
A polyhedral study of the asymmetric traveling salesman problem with time windows
A polyhedral study of the asymmetric traveling salesman problem with time windows
2000,
The asymmetric traveling salesman problem with time windows (ATSP-TW) is a basic model...
A truncated primal-infeasible dual-feasible network interior point mathod
A truncated primal-infeasible dual-feasible network interior point mathod
2000,
In this paper, we introduce the truncated primal-infeasible dual-feasible interior...
Improved criteria for identifying optimal basic and nonbasic variables in linear programming
Improved criteria for identifying optimal basic and nonbasic variables in linear programming
2001,
We derive new criteria for identifying whether a variable is basic or nonbasic for...
Progress in dynamic programming search for large-vocabulary continuous speech recognition
Progress in dynamic programming search for large-vocabulary continuous speech recognition
2000,
Initially introduced in the late 1960s and early 1970s, dynamic programming algorithms...
The conference paper-reviewer assignment problem
The conference paper-reviewer assignment problem
1999,
Conference organizers often face the following problem: Given a collection of...
A general framework for functional networks
A general framework for functional networks
2000,
In this paper, we introduce functional networks as a generalization and extension of...
The effect of misclassification costs on neural network classifiers
The effect of misclassification costs on neural network classifiers
1999,
The potential of neural networks for classification problems has been established by...
The cardinality-constrained shortest path problem in 2-graphs
The cardinality-constrained shortest path problem in 2-graphs
2000,
We study the cardinality-constrained shortest path problem in acyclic graphs and, in...
Robust path choice in networks with failures
Robust path choice in networks with failures
2000,
The problem of adaptive routing in a network with failures is considered. The network...
New polynomial-time cycle-canceling algorithms for minimum-cost flows
New polynomial-time cycle-canceling algorithms for minimum-cost flows
2000,
The cycle-canceling algorithm is one of the earliest algorithms to solve the...
A characterization of the two-commodity network design problem
A characterization of the two-commodity network design problem
2000,
We study the uncapacitated version of the two-commodity network design problem. We...
Dynamic slope scaling and trust interval techniques for solving concave piecewise linear network flow problems
Dynamic slope scaling and trust interval techniques for solving concave piecewise linear network flow problems
2000,
In this paper, we propose an efficient heuristic approach for solving concave...
Tabu search for the Steiner problem in graphs
Tabu search for the Steiner problem in graphs
2000,
Given an undirected graph with weights associated with its edges, the Steiner tree...
Channel assignment and weighted coloring
Channel assignment and weighted coloring
2000,
In cellular telephone networks, set of radio channels (colors) must be assigned to...
Constrained length connectivity and survivable networks
Constrained length connectivity and survivable networks
2000,
Some problems related to constrained length connectivity are addressed in this paper....
A probabilistic local majority polling game on weighted directed graphs with an application to the distributed agreement problem
A probabilistic local majority polling game on weighted directed graphs with an application to the distributed agreement problem
2000,
In this paper, we investigate a probabilistic local majority polling game on weighted...
The searchlight guarding problem on weighted split graphs and weighted cographs
The searchlight guarding problem on weighted split graphs and weighted cographs
2000,
This paper addresses the searchlight guarding problem, which is an extension of...
Papers per page: