3333 search results - page 251 / 667 » Abstract Proof Search |
149
click to vote
OPODIS
2007
15 years 8 months ago
2007
Abstract. Blin et al. (2006) proposed a distributed protocol that enables the smallest number of searchers to clear any unknown asynchronous graph in a decentralized manner. Unknow...
169
click to vote
INTERNET
2008
15 years 6 months ago
2008
through suitable abstractions and tools is a viable option for improving servicebased computations. T he past few years have witnessed end users' increasing involve ment in th...
241
click to vote
CORR
1999
Springer
15 years 6 months ago
1999
Springer
Abstract. Nearest neighbor searching is a fundamental computational problem. A set of n data points is given in real d-dimensional space, and the problem is to preprocess these poi...
179
click to vote
WWW
2008
ACM
16 years 7 months ago
2008
ACM
With the emergence of Yahoo Pipes and several similar services, data mashup tools have started to gain interest of business users. Making these tools simple and accessible to user...
185
click to vote
SLS
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. In this paper, a real-life routing and scheduling problem encountered is addressed. The problem, which consists in optimizing the delivery of fluids by tank trucks on a ...