3678 search results - page 678 / 736 » On the Stable Paths Problem |
AAAI
2010
13 years 11 months ago
2010
g Without a Heuristic: Efficient Use of Abstraction Bradford Larsen, Ethan Burns, Wheeler Ruml Department of Computer Science University of New Hampshire Durham, NH 03824 USA blars...
CIC
2004
13 years 11 months ago
2004
As a key issue in multicast routing with quality of service (QoS) support, constrained minimum Steiner tree (CMST) problem has been a research focus for more than a decade, and ten...
WSC
2000
13 years 11 months ago
2000
We compare the performance of five well-known truncation heuristics for mitigating the effects of initialization bias in the output analysis of steady-state simulations. Two of th...
BIRTHDAY
2010
Springer
13 years 11 months ago
2010
Springer
Many natural problems in computer science concern structures like graphs where elements are not inherently ordered. In contrast, Turing machines and other common models of computa...
ALGORITHMICA
2007
13 years 10 months ago
2007
In this paper we study the problems of detecting holes and antiholes in general undirected graphs, and we present algorithms for these problems. For an input graph G on n vertices ...