Sciweavers

3713 search results - page 542 / 743
» Constructing a Calculus of Programs
Sort
View
MFCS
2005
Springer
15 years 8 months ago
Coloring Sparse Random k-Colorable Graphs in Polynomial Expected Time
Abstract. Feige and Kilian [5] showed that finding reasonable approximative solutions to the coloring problem on graphs is hard. This motivates the quest for algorithms that eithe...
Julia Böttcher
DFG
2004
Springer
15 years 8 months ago
Executable HybridUML and Its Application to Train Control Systems
Abstract. In this paper, the authors introduce an extension of UML for the purpose of hybrid systems modeling. The construction uses the profile mechanism of UML 2.0 which is the ...
Kirsten Berkenkötter, Stefan Bisanz, Ulrich H...
FASE
2004
Springer
15 years 8 months ago
A Formal Treatment of Context-Awareness
Context-aware computing refers to a computing paradigm in which the behavior of individual components is determined by the circumstances in which they find themselves to an extent...
Gruia-Catalin Roman, Christine Julien, Jamie Payto...
ICALP
2004
Springer
15 years 8 months ago
Simple Permutations Mix Well
We study the random composition of a small family of O(n3 ) simple permutations on {0, 1}n . Specifically we ask what is the number of compositions needed to achieve a permutatio...
Shlomo Hoory, Avner Magen, Steven Myers, Charles R...
OOPSLA
2004
Springer
15 years 8 months ago
Scalable extensibility via nested inheritance
Inheritance is a useful mechanism for factoring and reusing code. However, it has limitations for building extensible systems. We describe nested inheritance, a mechanism that add...
Nathaniel Nystrom, Stephen Chong, Andrew C. Myers