3678 search results - page 345 / 736 » On the Stable Paths Problem |
183
click to vote
CCE
2004
15 years 6 months ago
2004
The idea of cyclic scheduling is commonly utilized to address short-term scheduling problems for multiproduct batch plants under the assumption of relatively stable operations and...
189
click to vote
CORR
1998
Springer
15 years 6 months ago
1998
Springer
In this paper we consider the problem of theory patching, in which we are given a domain theory, some of whose components are indicated to be possibly awed, and a set of labeled t...
195
click to vote
IMC
2007
ACM
15 years 8 months ago
2007
ACM
We address the problem of efficient end-to-end network monitoring of path metrics in communication networks. Our goal is to minimize the number of measurements or monitors requir...
165
click to vote
IROS
2009
IEEE
16 years 1 months ago
2009
IEEE
— Despite the large body of work in both motion planning and multi-agent simulation, little work has focused on the problem of planning motion for groups of robots using external...
179
click to vote
SODA
2010
ACM
16 years 4 months ago
2010
ACM
The group Steiner problem is a classical network design problem where we are given a graph and a collection of groups of vertices, and want to build a min-cost subgraph that conne...