Sciweavers

9842 search results - page 1652 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
ASP
2003
Springer
15 years 12 months ago
Outlier Detection Using Default Logic
Default logic is used to describe regular behavior and normal properties. We suggest to exploit the framework of default logic for detecting outliers - individuals who behave in a...
Fabrizio Angiulli, Rachel Ben-Eliyahu-Zohary, Luig...
ATAL
2003
Springer
15 years 12 months ago
Information-driven phase changes in multi-agent coordination
Large systems of agents deployed in a real-world environment face threats to their problem solving performance that are independent of the complexity of the problem or the charact...
Sven Brueckner, H. Van Dyke Parunak
CSEE
2003
Springer
15 years 12 months ago
The Cross-Course Software Engineering Project at the NTNU: Four Years of Experience
Many software engineering courses include all-term projects to convey principles relating to large-scale multi-person development. But even such projects will easily be too small ...
Guttorm Sindre, Tor Stålhane, Gunnar Brataas...
EUROPAR
2003
Springer
15 years 12 months ago
Why Not Use a Pattern-Based Parallel Programming System?
Parallel programming is seen as an effective technique to improve the performance of computationally-intensive programs. This is done at the cost of increasing the complexity of t...
John Anvik, Jonathan Schaeffer, Duane Szafron, Kai...
EUROPAR
2003
Springer
15 years 12 months ago
Parallel ScaLAPACK-Style Algorithms for Solving Continuous-Time Sylvester Matrix Equations
An implementation of a parallel ScaLAPACK-style solver for the general Sylvester equation, op(A)X −Xop(B) = C, where op(A) denotes A or its transpose AT , is presented. The paral...
Robert Granat, Bo Kågström, Peter Porom...
« Prev « First page 1652 / 1969 Last » Next »