2632 search results - page 442 / 527 » Alternating Timed Automata |
124
click to vote
ACMMSP
2006
ACM
15 years 3 months ago
2006
ACM
We introduce a method for providing lightweight daemons, called simplifiers, that attach themselves to program data. If a data item has a simplifier, the simplifier may be run aut...
100
click to vote
IDMS
2000
Springer
15 years 3 months ago
2000
Springer
Abstract. In this paper, we propose static and dynamic server selection techniques for multicast receivers who receive multiple streams from replicated servers. In the proposed sta...
AIPS
2007
15 years 2 months ago
2007
In context-aware route planning, agents have to plan their route on a common infrastructure in such a way that plans made by other agents are not invalidated, and no conflicts ar...
105
click to vote
SBBD
2004
15 years 1 months ago
2004
Today, neither transactional provisions, in general, nor concurrency control, in particular, of DBMS-based processing are tailored to the specific needs of large and collaborative...
CONEXT
2009
ACM
15 years 1 months ago
2009
ACM
Network traffic can be represented by a Traffic Dispersion Graph (TDG) that contains an edge between two nodes that send a particular type of traffic (e.g., DNS) to one another. T...