748 search results - page 133 / 150 » Time and Probability in Process Algebra |
STOC
2010
ACM
14 years 8 days ago
2010
ACM
The Steiner tree problem is one of the most fundamental ÆÈ-hard problems: given a weighted undirected graph and a subset of terminal nodes, find a minimum weight tree spanning ...
ICPP
1999
IEEE
13 years 11 months ago
1999
IEEE
The probability of failures in software distributed shared memory (SDSM) increases as the system size grows. This paper introduces a new, efficient message logging technique, call...
HT
2009
ACM
13 years 10 months ago
2009
ACM
We introduce four measures for the change of coalitions in social networks. The first one measures the change of the agents in the network over time, The second one measures the ...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
: We study a slotted version of the Aloha Medium Access (MAC) protocol in a Mobile Ad-hoc Network (MANET). Our model features transmitters randomly located in the Euclidean plane, ...
IOR
2002
13 years 7 months ago
2002
We describe a simple on-line heuristic for scheduling job-shops. We assume there is a fixed set of routes for the jobs, and many jobs, say N, on each route. The heuristic uses saf...