1220 search results - page 73 / 244 » Minimal Interval Completions |
SIGSOFT
1995
ACM
14 years 24 days ago
1995
ACM
—We conducted a long-term experiment to compare the costs and benefits of several different software inspection methods. These methods were applied by professional developers to ...
CORR
2010
Springer
13 years 9 months ago
2010
Springer
Abstract. We present the discrete beeping communication model, which assumes nodes have minimal knowledge about their environment and severely limited communication capabilities. S...
LATIN
2010
Springer
13 years 11 months ago
2010
Springer
We study the problem of designing truthful algorithms for scheduling a set of tasks, each one owned by a selfish agent, to a set of parallel (identical or unrelated) machines in or...
CLOUD
2010
ACM
14 years 2 months ago
2010
ACM
Parallel dataflow programs generate enormous amounts of distributed data that are short-lived, yet are critical for completion of the job and for good run-time performance. We ca...
COCOON
2007
Springer
14 years 1 months ago
2007
Springer
This paper deals with problems which fall into the domain of selfish scheduling: a protocol is in charge of building a schedule for a set of tasks without directly knowing their l...