Sciweavers

16568 search results - page 3041 / 3314
» Structured Data on the Web
Sort
View
ESA
1998
Springer
108views Algorithms» more  ESA 1998»
15 years 8 months ago
Finding an Optimal Path without Growing the Tree
In this paper, we study a class of optimal path problems with the following phenomenon: The space complexity of the algorithms for reporting the lengths of single-source optimal pa...
Danny Z. Chen, Ovidiu Daescu, Xiaobo Hu, Jinhui Xu
EUROPAR
1998
Springer
15 years 8 months ago
Parallel Sparse Matrix Computations Using the PINEAPL Library: A Performance Study
Abstract. The Numerical Algorithms Group Ltd is currently participating in the European HPCN Fourth Framework project on Parallel Industrial NumErical Applications and Portable Lib...
Arnold R. Krommer
JELIA
1998
Springer
15 years 8 months ago
A Logic for Anytime Deduction and Anytime Compilation
Abstract. One of the maincharacteristics of logical reasoning in knowledge based systems is its high computational complexity. Anytime deduction and anytime compilation are two att...
Frédéric Koriche
OOPSLA
1998
Springer
15 years 8 months ago
Visualizing Dynamic Software System Information Through High-Level Models
Dynamic information collected as a software system executes can help software engineers perform some tasks on a system more effectively. To interpret the sizable amount of data ge...
Robert J. Walker, Gail C. Murphy, Bjørn N. ...
ICECCS
1997
IEEE
114views Hardware» more  ICECCS 1997»
15 years 8 months ago
An approach to integration testing based on architectural descriptions
Software architectures can play a role in improving the testing process of complex systems. In particular, descriptions of the software architecture can be useful to drive integra...
Antonia Bertolino, Paola Inverardi, Henry Muccini,...
« Prev « First page 3041 / 3314 Last » Next »