Sciweavers

6740 search results - page 1147 / 1348
» An s -Hamiltonian Line Graph Problem
Sort
View
IEEEPACT
2003
IEEE
15 years 9 months ago
Resolving Register Bank Conflicts for a Network Processor
This paper discusses a register bank assignment problem for a popular network processor--Intel's IXP. Due to limited data paths, the network processor has a restriction that ...
Xiaotong Zhuang, Santosh Pande
LICS
2003
IEEE
15 years 9 months ago
Model checking for probability and time: from theory to practice
Probability features increasingly often in software and hardware systems: it is used in distributed co-ordination and routing problems, to model fault-tolerance and performance, a...
Marta Z. Kwiatkowska
COSIT
2003
Springer
132views GIS» more  COSIT 2003»
15 years 9 months ago
"Simplest" Paths: Automated Route Selection for Navigation
Numerous cognitive studies have indicated that the form and complexity of route instructions may be as important to human navigators as the overall length of route. Most automated ...
Matt Duckham, Lars Kulik
ICCBR
2003
Springer
15 years 9 months ago
Evaluation of Case-Based Maintenance Strategies in Software Design
CBR applications running in real domains can easily reach thousands of cases, which are stored in the case library. Retrieval times can increase greatly if the retrieval algorithm ...
Paulo Gomes, Francisco C. Pereira, Paulo Paiva, Nu...
LATIN
2010
Springer
15 years 9 months ago
Euclidean Prize-Collecting Steiner Forest
In this paper, we consider Steiner forest and its generalizations, prize-collecting Steiner forest and k-Steiner forest, when the vertices of the input graph are points in the Euc...
MohammadHossein Bateni, MohammadTaghi Hajiaghayi
« Prev « First page 1147 / 1348 Last » Next »