Sciweavers

2262 search results - page 309 / 453
» Challenging Applications on Fast Networks
Sort
View
UIST
2000
ACM
15 years 10 months ago
A programming model for active documents
Traditionally, designers organize software system as active end-points (e.g. applications) linked by passive infrastructures (e.g. networks). Increasingly, however, networks and i...
Paul Dourish, W. Keith Edwards, Jon Howell, Anthon...
ECAI
2000
Springer
15 years 10 months ago
A Framework for Dynamic Constraint Reasoning using Procedural Constraints
Many complex real-world decision problems, such as planning, contain an underlying constraint reasoning problem. The feasibility of a solution candidate then depends on the consis...
Ari K. Jónsson, Jeremy Frank
JTAER
2006
143views more  JTAER 2006»
15 years 6 months ago
P2P's Significance for eBusiness: Towards a Research Agenda
Applications running over peer-to-peer (P2P) networks have exploded since the late 1990s. Research is needed into many aspects of P2P. These include architecture, application func...
Roger Clarke
CLUSTER
2004
IEEE
15 years 6 months ago
A Synchronous Co-Allocation Mechanism for Grid Computing Systems
Grid computing systems are emerging as a computing infrastructure that will enable the use of wide-area network computing systems for a variety of challenging applications. One of ...
Farag Azzedin, Muthucumaru Maheswaran, Neil Arnaso...
MMB
2010
Springer
194views Communications» more  MMB 2010»
15 years 11 months ago
Searching for Tight Performance Bounds in Feed-Forward Networks
Abstract. Computing tight performance bounds in feed-forward networks under general assumptions about arrival and server models has turned out to be a challenging problem. Recently...
Andreas Kiefer, Nicos Gollan, Jens B. Schmitt