Sciweavers

7758 search results - page 1230 / 1552
» On the Number of Distributive Lattices
Sort
View
CN
2002
195views more  CN 2002»
15 years 6 months ago
A simulation study of the OSPF-OMP routing algorithm
Open shortest path first (OSPF) is the most widely used internal gateway routing protocol on the Internet. However, one shortcoming is that it does not take advantage of the exist...
G. Michael Schneider, Tamás Németh
JAR
2000
123views more  JAR 2000»
15 years 6 months ago
Local Search Algorithms for SAT: An Empirical Evaluation
Local search algorithms are among the standard methods for solving hard combinatorial problems from various areas of Artificial Intelligence and Operations Research. For SAT, some ...
Holger H. Hoos, Thomas Stützle
JGAA
2000
179views more  JGAA 2000»
15 years 6 months ago
Approximation Algorithms for Some Graph Partitioning Problems
This paper considers problems of the following type: given an edgeweighted k-colored input graph with maximum color class size c, find a minimum or maximum c-way cut such that eac...
George He, Jiping Liu, Cheng Zhao
JIRS
2000
133views more  JIRS 2000»
15 years 6 months ago
Managing Complexity in Large Learning Robotic Systems
Abstract. Autonomous learning systems of significant complexity often consist of several interacting modules or agents. These modules collaborate to produce a system which, when vi...
Kynan Eng, Alec P. Robertson, Deane R. Blackman
MMS
2000
15 years 6 months ago
Failure Recovery Algorithms for Multimedia Servers
In this paper, we present two novel disk failure recovery methods that utilize the inherent characteristics of video streams for efficient recovery. Whereas the first method explo...
Prashant J. Shenoy, Harrick M. Vin
« Prev « First page 1230 / 1552 Last » Next »