Sciweavers

2436 search results - page 175 / 488
» Comonadic Notions of Computation
Sort
View
AAAI
2007
15 years 6 months ago
Partial Matchmaking using Approximate Subsumption
Description Logics, and in particular the web ontology language OWL has been proposed as an appropriate basis for computing matches between structured objects for the sake of info...
Heiner Stuckenschmidt
CCGRID
2008
IEEE
15 years 6 months ago
Formal Verification of a Grid Resource Allocation Protocol
As the adoption of grid technology moves from science to industry, new requirements arise. In todays grid middlewares, the notion of paying for a job is a secondary requirement. In...
Mathias Dalheimer, Franz-Josef Pfreundt, Peter Mer...
PODC
2010
ACM
15 years 6 months ago
Brief announcement: capacity of byzantine agreement with finite link capacity - complete characterization of four-node networks
In this paper, we consider the problem of maximizing the throughput of Byzantine agreement, when communication links have finite capacity. Byzantine agreement is a classical probl...
Guanfeng Liang, Nitin Vaidya
INTERACT
2003
15 years 5 months ago
Ontology for Multi-surface Interaction
: Digital computation is a powerful source of functional support. However, it has been confined to the augmentation of single objects only. In this article, we are interested in th...
Joëlle Coutaz, Christophe Lachenal, Sophie Du...
156
Voted
PUK
2000
15 years 5 months ago
Dynamic Scheduling of Progressive Processing Plans
Progressive processing plans allow systems to tradeoff computational resources against the quality of service by specifying alternative ways in which to accomplish each step. When ...
Shlomo Zilberstein, Abdel-Illah Mouaddib, Andrew A...