Country: United States

Found 17049 papers in total
Analysis of an adaptive algorithm to find the two nearest neighbors
Analysis of an adaptive algorithm to find the two nearest neighbors
2001,
Given a set S of N distinct elements in random order and a pivot x is an element of S...
Fault-tolerant minimum broadcast networks
Fault-tolerant minimum broadcast networks
1996,
Broadcasting is the task of transmitting a message originated at one processor of a...
Broadcasting in synchronous networks with dynamic faults
Broadcasting in synchronous networks with dynamic faults
1996,
The problem of broadcasting in a network is to disseminate information from one node...
Routing algorithms for switching networks with probabilistic traffic
Routing algorithms for switching networks with probabilistic traffic
1996,
Switching networks with probabilistic traffic are positioned prominently in...
A new method for efficient symbolic propagation in discrete Bayesian networks
A new method for efficient symbolic propagation in discrete Bayesian networks
1996,
This paper presents a new efficient method for uncertainty propagation in discrete...
Minimal rankings
Minimal rankings
1996,
A k -ranking, f , for a graph G is a function f:V(G) →{1,2,...,k} such that if u,...
Topological network design of state-dependent queueing networks
Topological network design of state-dependent queueing networks
1996,
Topological network design problems often contain nodes and arcs where the stochastic...
Vulnerability of scheduled networks and a generalization of Menger's theorem
Vulnerability of scheduled networks and a generalization of Menger's theorem
1996,
An edge-scheduled network N is a multigraph G = ( V, E ), where each edge e ∈ E...
Fault-tolerant broadcasting and gossiping in communication networks
Fault-tolerant broadcasting and gossiping in communication networks
1996,
Broadcasting and gossiping are fundamental tasks in network communication. In...
The multilevel hypercube: A hierarchical hypercube network
The multilevel hypercube: A hierarchical hypercube network
1996,
In this paper, we present and analyze a new network called the Multilevel Hypercube...
An approximation scheme for some Steiner tree problems in the plane
An approximation scheme for some Steiner tree problems in the plane
1996,
We design a polynomial-time approximation scheme for the Steiner tree problem in the...
Optimal packet fragmentation and routing in computer networks
Optimal packet fragmentation and routing in computer networks
1997,
The packet fragmentation problem in computer networks is that of breaking a packet...
A lower bound for interval routing in general networks
A lower bound for interval routing in general networks
1997,
Interval routing is a space-efficient routing method for point-to-point communication...
A branch-and-cut algorithm for the resource-constrained minimum-weight arborescence problem
A branch-and-cut algorithm for the resource-constrained minimum-weight arborescence problem
1997,
In this paper, we present a branch-and-cut algorithm for the exact solution of an...
The tree center problems and the relationship with the bottleneck knapsack problems
The tree center problems and the relationship with the bottleneck knapsack problems
1997,
The tree center problems are designed to find a subtree minimizing the maximum...
A tabu search algorithm for the capacitated shortest spanning tree problem
A tabu search algorithm for the capacitated shortest spanning tree problem
1997,
The Capacitated Shortest Scanning Tree Problem consists of determining a shortest...
Have US manufacturing inventories really decreased? An empirical study
Have US manufacturing inventories really decreased? An empirical study
2001,
Numerous normative models have been developed to determine optimal inventory levels,...
Approximating reduced costs under degeneracy in a network flow problem with side constraints
Approximating reduced costs under degeneracy in a network flow problem with side constraints
1996,
Reduced costs obtained from the optimal simplex tableau are not necessarily correct...
Work-team implementation and trajectories of manufacturing quality: A longitudinal field study
Work-team implementation and trajectories of manufacturing quality: A longitudinal field study
2001,
The study examines the sustainability of manufacturing quality improvements following...
Modelling the dynamics of supply chains
Modelling the dynamics of supply chains
2000,
A summary of the important issues arising in supply chain research is presented. A...
Motive, opportunity, choice, and corporate illegality
Motive, opportunity, choice, and corporate illegality
1997,
Research on corporate illegality spans several distinct literatures and defies ready...
Serial production distribution systems under service constraints
Serial production distribution systems under service constraints
2001,
We analyze the problem of minimizing average inventory costs subject to fill-rate type...
A method for obtaining the maximum multiroute flows in a network
A method for obtaining the maximum multiroute flows in a network
1996,
In a communication network, a multiroute channel is more reliable than is an ordinary...
Utilizing forecast band refinement for capacitated production planning
Utilizing forecast band refinement for capacitated production planning
2001,
We present a model for forecast evolution that captures two notions related to...
Papers per page: