Sciweavers

1632 search results - page 205 / 327
» Sublinear Time Algorithms for Metric Space Problems
Sort
View
SPIRE
2010
Springer
15 years 2 months ago
String Matching with Variable Length Gaps
We consider string matching with variable length gaps. Given a string T and a pattern P consisting of strings separated by variable length gaps (arbitrary strings of length in a sp...
Philip Bille, Inge Li Gørtz, Hjalte Wedel V...
172
Voted
GRID
2008
Springer
15 years 4 months ago
Replica Placement Strategies in Data Grid
Replication is a technique used in Data Grid environments that helps to reduce access latency and network bandwidth utilization. Replication also increases data availability thereb...
Rashedur M. Rahman, Ken Barker, Reda Alhajj
132
Voted
JPDC
2006
92views more  JPDC 2006»
15 years 4 months ago
Task assignment in heterogeneous computing systems
The problem of task assignment in heterogeneous computing systems has been studied for many years with many variations. We consider the version in which communicating tasks are to...
Bora Uçar, Cevdet Aykanat, Kamer Kaya, Mura...
CP
2001
Springer
15 years 8 months ago
A General Scheme for Multiple Lower Bound Computation in Constraint Optimization
Abstract. Computing lower bounds to the best-cost extension of a tuple is an ubiquous task in constraint optimization. A particular case of special interest is the computation of l...
Rina Dechter, Kalev Kask, Javier Larrosa
IPSN
2010
Springer
15 years 11 months ago
Bayesian optimization for sensor set selection
We consider the problem of selecting an optimal set of sensors, as determined, for example, by the predictive accuracy of the resulting sensor network. Given an underlying metric ...
Roman Garnett, Michael A. Osborne, Stephen J. Robe...