Sciweavers

3047 search results - page 206 / 610
» Randomized Parallel Selection
Sort
View
IPPS
1997
IEEE
15 years 3 months ago
Control Schemes in a Generalized Utility for Parallel Branch-and-Bound Algorithms
Branch-and-bound algorithms are general methods applicable to various combinatorial optimization problems and parallelization is one of the most hopeful methods to improve these a...
Yuji Shinano, Kenichi Harada, Ryuichi Hirabayashi
ATAL
2008
Springer
15 years 1 months ago
Modeling parallel and reactive empathy in virtual agents: an inductive approach
Humans continuously assess one another's situational context, modify their own affective state, and then respond based on these outcomes through empathetic expression. Virtua...
Scott W. McQuiggan, Jennifer L. Robison, Robert Ph...
MST
1998
91views more  MST 1998»
14 years 10 months ago
An Experimental Analysis of Parallel
We have developed a methodology for predicting the performance of parallel algorithms on real parallel machines. The methodology consists of two steps. First, we characterize a mac...
Guy E. Blelloch, Charles E. Leiserson
PVLDB
2008
182views more  PVLDB 2008»
14 years 10 months ago
SCOPE: easy and efficient parallel processing of massive data sets
Companies providing cloud-scale services have an increasing need to store and analyze massive data sets such as search logs and click streams. For cost and performance reasons, pr...
Ronnie Chaiken, Bob Jenkins, Per-Åke Larson,...
KDD
2005
ACM
170views Data Mining» more  KDD 2005»
15 years 11 months ago
Parallel mining of closed sequential patterns
Discovery of sequential patterns is an essential data mining task with broad applications. Among several variations of sequential patterns, closed sequential pattern is the most u...
Shengnan Cong, Jiawei Han, David A. Padua