Sciweavers

1191 search results - page 132 / 239
» Completeness and Performance Of The APO Algorithm
Sort
View
ICDE
2011
IEEE
265views Database» more  ICDE 2011»
14 years 1 months ago
RAFTing MapReduce: Fast recovery on the RAFT
MapReduce is a computing paradigm that has gained a lot of popularity as it allows non-expert users to easily run complex analytical tasks at very large-scale. At such scale, task...
Jorge-Arnulfo Quiané-Ruiz, Christoph Pinkel...
POPL
2011
ACM
14 years 24 days ago
Safe nondeterminism in a deterministic-by-default parallel language
A number of deterministic parallel programming models with strong safety guarantees are emerging, but similar support for nondeterministic algorithms, such as branch and bound sea...
Robert L. Bocchino Jr., Stephen Heumann, Nima Hona...
KDD
2012
ACM
212views Data Mining» more  KDD 2012»
13 years 12 days ago
Harnessing the wisdom of the crowds for accurate web page clipping
Clipping Web pages, namely extracting the informative clips (areas) from Web pages, has many applications, such as Web printing and e-reading on small handheld devices. Although m...
Lei Zhang, Linpeng Tang, Ping Luo, Enhong Chen, Li...
SIGIR
2012
ACM
13 years 11 days ago
Search, interrupted: understanding and predicting search task continuation
Many important search tasks require multiple search sessions to complete. Tasks such as travel planning, large purchases, or job searches can span hours, days, or even weeks. Inev...
Eugene Agichtein, Ryen W. White, Susan T. Dumais, ...
CLUSTER
2005
IEEE
15 years 3 months ago
Search-based Job Scheduling for Parallel Computer Workloads
To balance performance goals and allow administrators to declaratively specify high-level performance goals, we apply complete search algorithms to design on-line job scheduling p...
Sangsuree Vasupongayya, Su-Hui Chiang, B. Massey