Sciweavers

23119 search results - page 4504 / 4624
» From Domain to Requirements
Sort
View
SODA
1998
ACM
157views Algorithms» more  SODA 1998»
15 years 7 months ago
A Polynomial Time Approximation Scheme for Minimum Routing Cost Spanning Trees
Given an undirected graph with nonnegative costs on the edges, the routing cost of any of its spanning trees is the sum over all pairs of vertices of the cost of the path between t...
Bang Ye Wu, Giuseppe Lancia, Vineet Bafna, Kun-Mao...
158
Voted
PDSE
2000
96views more  PDSE 2000»
15 years 7 months ago
Applying Distributed Object Technology to Network Planning
The aim of this paper is to describe a generic interface through which a planning tool or design aid can be connected to a telecommunications network. In today's complex and ...
Tertius D. Wessels, Judy M. Bishop
180
Voted
IJCAI
1997
15 years 7 months ago
Object Identification in a Bayesian Context
Object identification—the task of deciding that two observed objects are in fact one and the same object—is a fundamental requirement for any situated agent that reasons about...
Timothy Huang, Stuart J. Russell
156
Voted
WSC
1998
15 years 7 months ago
Communication Mission-type Orders to Virtual Commanders
This paper discusses issues in modeling C4I and cognitive processes in next generation simulations and applications to Force XXI command and control. We propose a modification to ...
Martin S. Kleiner, Scott A. Carey, Joseph E. Beach
200
Voted
WSC
1998
15 years 7 months ago
Implementing the Theory of Constraints Philosophy in Highly Reentrant Systems
A significant challenge in implementing the Theory of Constraints in the semiconductor industry is the complex and reentrant nature of the manufacturing process. Managing a constr...
Clay Rippenhagen, Shekar Krishnaswamy
« Prev « First page 4504 / 4624 Last » Next »