4798 search results - page 873 / 960 » Time for a change |
OSDI
2002
ACM
15 years 10 months ago
2002
ACM
This paper shows how to quickly move the state of a running computer across a network, including the state in its disks, memory, CPU registers, and I/O devices. We call this state...
ICALP
2009
Springer
15 years 10 months ago
2009
Springer
Traditionally, combinatorial optimization problems (such as maximum flow, maximum matching, etc.) have been studied for networks where each link has a fixed capacity. Recent resear...
176
click to vote
VLDB
2007
ACM
15 years 10 months ago
2007
ACM
The deep Web presents a pressing need for integrating large numbers of dynamically evolving data sources. To be more automatic yet accurate in building an integration system, we o...
153
click to vote
SIGMOD
2009
ACM
15 years 10 months ago
2009
ACM
views abstract groups of tasks in a workflow into high level composite tasks, in order to reuse sub-workflows and facilitate provenance analysis. However, unless a view is careful...
147
click to vote
SIGMOD
2008
ACM
15 years 10 months ago
2008
ACM
In late May, 2008, a group of database researchers, architects, users and pundits met at the Claremont Resort in Berkeley, California to discuss the state of the research field an...