Sciweavers

4998 search results - page 873 / 1000
» The case for intentional networking
Sort
View
INFOCOM
1996
IEEE
14 years 1 months ago
Group Priority Scheduling
We present an end-to-end delay guarantee theorem for a class of guaranteed-deadline (GD) servers. The theorem can be instantiated to obtain end-to-end delay bounds for a variety of...
Simon S. Lam, Geoffrey G. Xie
WADS
1997
Springer
88views Algorithms» more  WADS 1997»
14 years 1 months ago
Finding Cores of Limited Length
In this paper we consider the problem of nding a core of limited length in a tree. A core is a path, which minimizes the sum of the distances to all nodes in the tree. This proble...
Stephen Alstrup, Peter W. Lauridsen, Peer Sommerlu...
IFIP
1994
Springer
14 years 1 months ago
E-mail as an Enabling Technology in Brazil: The CNPq/ProTeM-CC Experience
Development of a research project in Computer Science, integrating a considerable number of research institutions and about 1200 individual researchers all over a country with big...
José Palazzo M. de Oliveira, Norberto Hoppe...
ACMSE
1990
ACM
14 years 1 months ago
Computerizing a machine readable dictionary
Current research in natural language processing is characterized by the development of theories of grammar which strongly depend on the lexicon to drive parsing systems (e.g. Lexi...
Jan G. Wilms
CEC
2009
IEEE
14 years 28 days ago
JubiTool: Unified design flow for the Perplexus SIMD hardware accelerator
This paper presents a new unified design flow developed within the Perplexus project that aims to accelerate parallelizable data-intensive applications in the context of ubiquitous...
Olivier Brousse, Jérémie Guillot, Th...