5448 search results - page 199 / 1090 » Breakpoints and Time in Distributed Computations |
111
click to vote
ATAL
2008
Springer
15 years 6 months ago
2008
Springer
Matchmaking is the process of introducing two or more agents to each other. Current matchmaking techniques are unidirectional and fail to address large-scale and highly dynamic sy...
135
click to vote
PADS
2005
ACM
15 years 10 months ago
2005
ACM
Simulation of large-scale networks requires enormous amounts of memory and processing time. One way of speeding up these simulations is to distribute the model over a number of co...
130
click to vote
ICPR
2006
IEEE
16 years 5 months ago
2006
IEEE
Tracking people or objects across multiple cameras is a challenging research area in visual computing especially when these cameras have non-overlapping field-of-views. The import...
114
click to vote
LPAR
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. In this paper we study the problem of solving hard propositional satisfiability problem (SAT) instances in a computing grid or cloud, where run times and communication b...
145
click to vote
IPPS
1999
IEEE
15 years 8 months ago
1999
IEEE
Abstract. In recent years, there has been a surge of interest in Javabased volunteer computing systems, which aim to make it possible to build very large parallel computing network...