Sciweavers

1890 search results - page 305 / 378
» A case for network musical performance
Sort
View
CP
2007
Springer
13 years 12 months ago
Efficient Computation of Minimal Point Algebra Constraints by Metagraph Closure
Abstract. Computing the minimal network (or minimal CSP) representation of a given set of constraints over the Point Algebra (PA) is a fundamental reasoning problem. In this paper ...
Alfonso Gerevini, Alessandro Saetti
ASPDAC
2004
ACM
96views Hardware» more  ASPDAC 2004»
13 years 11 months ago
Rate analysis for streaming applications with on-chip buffer constraints
While mapping a streaming (such as multimedia or network packet processing) application onto a specified architecture, an important issue is to determine the input stream rates tha...
Alexander Maxiaguine, Simon Künzli, Samarjit ...
ECAI
2006
Springer
13 years 11 months ago
Environment-Driven Skeletal Plan Execution for the Medical Domain
An important application of both data abstraction and plan execution is the execution of clinical guidelines and protocols (CGP), both to validate them against a large set of test ...
Peter Votruba, Andreas Seyfang, Michael Paesold, S...
INFOCOM
2000
IEEE
13 years 11 months ago
Competitive Queue Policies for Differentiated Services
We consider the setting of a network providing differentiated services. As is often the case in differentiated services, we assume that the packets are tagged as either being a hi...
William Aiello, Yishay Mansour, S. Rajagopolan, Ad...
PODC
2000
ACM
13 years 11 months ago
Efficient atomic broadcast using deterministic merge
We present an approach for merging message streams from producers distributed over a network, using a deterministic algorithm that is independent of any nondeterminism of the syst...
Marcos Kawazoe Aguilera, Robert E. Strom