Sciweavers

7274 search results - page 1131 / 1455
» Abstractions for network update
Sort
View
SEUS
2009
IEEE
16 years 2 months ago
Fine-Grained Tailoring of Component Behaviour for Embedded Systems
Abstract. The application of run-time reconfigurable component models to networked embedded systems has a number of significant advantages such as encouraging software reuse, ada...
Nelson Matthys, Danny Hughes, Sam Michiels, Christ...
254
Voted
SISAP
2009
IEEE
159views Data Mining» more  SISAP 2009»
16 years 2 months ago
Dynamic P2P Indexing and Search Based on Compact Clustering
Abstract—We propose a strategy to perform query processing on P2P similarity search systems based on peers and superpeers. We show that by approximating global but resumed inform...
Mauricio Marín, Veronica Gil Costa, Cecilia...
182
Voted
P2P
2009
IEEE
103views Communications» more  P2P 2009»
16 years 2 months ago
Towards Robust Peer Counting
Abstract—This paper describes T-SIZE, a peer counting protocol that is based on gossip-based aggregation. Peer counting has become increasingly important as the size of the netwo...
Alberto Montresor, Ali Ghodsi
RTAS
2009
IEEE
16 years 2 months ago
Partial Program Admission
Abstract—Real-time systems on non-preemptive platforms require a means of bounding the execution time of programs for admission purposes. Worst-Case Execution Time (WCET) is most...
Michael Wilson, Ron Cytron, Jonathan S. Turner
185
Voted
ISMVL
2009
IEEE
96views Hardware» more  ISMVL 2009»
16 years 2 months ago
Evaluation of Cardinality Constraints on SMT-Based Debugging
For formal verification of hardware Satisfiability Modulo Theory (SMT) solvers are increasingly applied. Today’s state-of-the-art SMT solvers use different techniques like ter...
André Sülflow, Robert Wille, Görs...
« Prev « First page 1131 / 1455 Last » Next »