Sciweavers

218 search results - page 2 / 44
» Making Paths Explicit in the Scout Operating System
Sort
View
ISPA
2005
Springer
13 years 10 months ago
A Generic Approach to Make Structured Peer-to-Peer Systems Topology-Aware
Abstract. With the help of distributed hash tables, the structured peerto-peer system has a short routing path and good extensibility. However, the mismatch between the overlay and...
Tongqing Qiu, Fan Wu, Guihai Chen
ICSE
2012
IEEE-ACM
11 years 7 months ago
make test-zesti: A symbolic execution solution for improving regression testing
Abstract—Software testing is an expensive and time consuming process, often involving the manual creation of comprehensive regression test suites. However, current testing method...
Paul Dan Marinescu, Cristian Cadar
ENTCS
2011
106views more  ENTCS 2011»
13 years 7 days ago
A Flexible Framework for Visualisation of Computational Properties of General Explicit Substitutions Calculi
SUBSEXPL is a system originally developed to visualise reductions, simplifications and normalisations in three important calculi of explicit substitutions and has been applied to...
F. L. C. de Moura, A. V. Barbosa, Mauricio Ayala-R...
ICDCS
2009
IEEE
14 years 2 days ago
Explicit Batching for Distributed Objects
Although distributed object systems, for example RMI and CORBA, enable object-oriented programs to be easily distributed across a network, achieving acceptable performance usually...
Eli Tilevich, William R. Cook, Yang Jiao
TMC
2011
158views more  TMC 2011»
13 years 6 days ago
Explicit Congestion Control Algorithms for Time Varying Capacity Media
—Explicit congestion control (XCC) is emerging as one potential solution for overcoming limitations inherent to the current TCP algorithm, characterized by unstable throughput, h...
Filipe Abrantes, João Taveira Araujo, Manue...