Sciweavers

8647 search results - page 1573 / 1730
» The Container Selection Problem
Sort
View
SAC
2004
ACM
16 years 11 days ago
Combining analysis and synthesis in a model of a biological cell
for ideas, and then abstract away from these ideas to produce algorithmic processes that can create problem solutions in a bottom-up manner. We have previously described a top-dow...
Ken Webb, Tony White
SIGCOMM
2004
ACM
16 years 11 days ago
The feasibility of supporting large-scale live streaming applications with dynamic application end-points
While application end-point architectures have proven to be viable solutions for large-scale distributed applications such as distributed computing and file-sharing, there is lit...
Kunwadee Sripanidkulchai, Aditya Ganjam, Bruce M. ...
SPAA
2004
ACM
16 years 11 days ago
The effect of faults on network expansion
We study the problem of how resilient networks are to node faults. Specifically, we investigate the question of how many faults a network can sustain and still contain a large (i...
Amitabha Bagchi, Ankur Bhargava, Amitabh Chaudhary...
SPAA
2004
ACM
16 years 11 days ago
Lower bounds for graph embeddings and combinatorial preconditioners
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
Gary L. Miller, Peter C. Richter
BIRTHDAY
2004
Springer
16 years 10 days ago
Pure Type Systems in Rewriting Logic: Specifying Typed Higher-Order Languages in a First-Order Logical Framework
Abstract. The logical and operational aspects of rewriting logic as a logical framework are tested and illustrated in detail by representing pure type systems as object logics. Mor...
Mark-Oliver Stehr, José Meseguer
« Prev « First page 1573 / 1730 Last » Next »