Sciweavers

1723 search results - page 225 / 345
» Predicting the Performance of IDA* using Conditional Distrib...
Sort
View
CPC
2010
117views more  CPC 2010»
15 years 1 months ago
On the Number of Perfect Matchings in Random Lifts
Let G be a fixed connected multigraph with no loops. A random n-lift of G is obtained by replacing each vertex of G by a set of n vertices (where these sets are pairwise disjoint)...
Catherine S. Greenhill, Svante Janson, Andrzej Ruc...
TPDS
2008
202views more  TPDS 2008»
15 years 4 months ago
Control-Based Adaptive Middleware for Real-Time Image Transmission over Bandwidth-Constrained Networks
Real-time image transmission is crucial to an emerging class of distributed embedded systems operating in open network environments. Examples include avionics mission replanning ov...
Xiaorui Wang, Ming Chen, Huang-Ming Huang, Venkita...
138
Voted
IPPS
2006
IEEE
15 years 10 months ago
Dynamic resource allocation of computer clusters with probabilistic workloads
Real-time resource scheduling is an important factor for improving the performance of cluster computing. In many distributed and parallel processing systems, particularly real-tim...
Marwan S. Sleiman, Lester Lipsky, Robert Sheahan
ICPP
1999
IEEE
15 years 8 months ago
SLC: Symbolic Scheduling for Executing Parameterized Task Graphs on Multiprocessors
Task graph scheduling has been found effective in performance prediction and optimization of parallel applications. A number of static scheduling algorithms have been proposed for...
Michel Cosnard, Emmanuel Jeannot, Tao Yang
PODS
1998
ACM
152views Database» more  PODS 1998»
15 years 8 months ago
A Cost Model for Similarity Queries in Metric Spaces
We consider the problem of estimating CPU (distance computations) and I/O costs for processing range and k-nearest neighbors queries over metric spaces. Unlike the specific case ...
Paolo Ciaccia, Marco Patella, Pavel Zezula