Sciweavers

4325 search results - page 247 / 865
» Incremental computation with names
Sort
View
ISOLA
2010
Springer
15 years 5 months ago
An Interface Algebra for Estimating Worst-Case Traversal Times in Component Networks
Abstract. Interface-based design relies on the idea that different components of a system may be developed independently and a system designer can connect them together only if th...
Nikolay Stoimenov, Samarjit Chakraborty, Lothar Th...
MODELS
2010
Springer
15 years 5 months ago
Active Operations on Collections
Abstract. Collections are omnipresent within models: collections of references can represent relations between objects, and collections of values can represent object attributes. C...
Olivier Beaudoux, Arnaud Blouin, Olivier Barais, J...
CCR
2010
132views more  CCR 2010»
15 years 4 months ago
Scafida: a scale-free network inspired data center architecture
Data centers have a crucial role in current Internet architecture supporting content-centric networking. State-of-theart data centers have different architectures like fat-tree [1...
László Gyarmati, Tuan Anh Trinh
ENTCS
2010
88views more  ENTCS 2010»
15 years 4 months ago
Range and Set Abstraction using SAT
d Set Abstraction using SAT Edd Barrett Andy King School of Computing, University of Kent, CT2 7NF, UK Symbolic decision trees are not the only way to correlate the relationship b...
Edd Barrett, Andy King
CORR
2011
Springer
169views Education» more  CORR 2011»
15 years 1 months ago
Lower bound for deterministic semantic-incremental branching programs solving GEN
We answer a problem posed in [GKM08] regarding a restricted model of small-space computation, tailored for solving the GEN problem. They define two variants of “incremental bra...
Dustin Wehr