Sciweavers

3758 search results - page 242 / 752
» A Complete Subsumption Algorithm
Sort
View
IAT
2007
IEEE
16 years 22 days ago
A Hybrid of Inference and Local Search for Distributed Combinatorial Optimization
We present a new hybrid algorithm for local search in distributed combinatorial optimization. This method is a mix between classical local search methods in which nodes take decis...
Adrian Petcu, Boi Faltings
IRI
2007
IEEE
16 years 21 days ago
MAGIC: A Multi-Activity Graph Index for Activity Detection
Suppose we are given a set A of activities of interest, a set O of observations, and a probability threshold p. We are interested in finding the set of all pairs (a, O ), where a...
Massimiliano Albanese, Andrea Pugliese, V. S. Subr...
ISPASS
2006
IEEE
16 years 12 days ago
Comparing multinomial and k-means clustering for SimPoint
SimPoint is a technique used to pick what parts of the program’s execution to simulate in order to have a complete picture of execution. SimPoint uses data clustering algorithms...
Greg Hamerly, Erez Perelman, Brad Calder
CCGRID
2005
IEEE
16 years 19 hour ago
Implementing MPI-IO atomic mode without file system support
The ROMIO implementation of the MPI-IO standard provides a portable infrastructure for use on top of any number of different underlying storage targets. These different targets va...
Robert B. Ross, Robert Latham, William Gropp, Raje...
CP
2005
Springer
15 years 12 months ago
Boosting Distributed Constraint Satisfaction
Abstract Competition and cooperation can boost the performance of a combinatorial search process. Both can be implemented with a portfolio of algorithms which run in parallel, give...
Georg Ringwelski, Youssef Hamadi