Sciweavers

5683 search results - page 1090 / 1137
» Interactive Schedulability Analysis
Sort
View
COCOON
2007
Springer
15 years 7 months ago
Connected Coloring Completion for General Graphs: Algorithms and Complexity
An r-component connected coloring of a graph is a coloring of the vertices so that each color class induces a subgraph having at most r connected components. The concept has been w...
Benny Chor, Michael R. Fellows, Mark A. Ragan, Igo...
CONCUR
2007
Springer
15 years 7 months ago
Rule-Based Modelling of Cellular Signalling
Abstract. Modelling is becoming a necessity in studying biological signalling pathways, because the combinatorial complexity of such systems rapidly overwhelms intuitive and qualit...
Vincent Danos, Jérôme Feret, Walter F...
CSL
2007
Springer
15 years 7 months ago
From Proofs to Focused Proofs: A Modular Proof of Focalization in Linear Logic
Abstract. Probably the most significant result concerning cut-free sequent calculus proofs in linear logic is the completeness of focused proofs. This completeness theorem has a n...
Dale Miller, Alexis Saurin
ICS
2007
Tsinghua U.
15 years 7 months ago
Adaptive Strassen's matrix multiplication
Strassen’s matrix multiplication (MM) has benefits with respect to any (highly tuned) implementations of MM because Strassen’s reduces the total number of operations. Strasse...
Paolo D'Alberto, Alexandru Nicolau
OOPSLA
2007
Springer
15 years 7 months ago
Scalable omniscient debugging
Omniscient debuggers make it possible to navigate backwards in time within a program execution trace, drastically improving the task of debugging complex applications. Still, they...
Guillaume Pothier, Éric Tanter, José...
« Prev « First page 1090 / 1137 Last » Next »