Sciweavers

683 search results - page 87 / 137
» A Fine-grained Analysis of a Simple Independent Set Algorith...
Sort
View
140
Voted
JAR
2011
112views more  JAR 2011»
14 years 10 months ago
A Framework for Certified Boolean Branch-and-Bound Optimization
We consider optimization problems of the form (S, cost), where S is a clause set over Boolean variables x1 . . . xn, with an arbitrary cost function cost: Bn → R, and the aim is ...
Javier Larrosa, Robert Nieuwenhuis, Albert Olivera...
160
Voted
CLUSTER
2000
IEEE
15 years 8 months ago
Multi-Grid Acceleration of a SIMPLE-Based CFD-Code and Aspects of Parallelization
The present study treats the calculation of the continuous phase of a multiphase flow, i.e. the numerical solution of the equations for a turbulent incompressible flow. An exist...
Klaus Bernert, Thomas Frank, Hellfried Schneider, ...
123
Voted
ICML
2009
IEEE
16 years 4 months ago
Near-Bayesian exploration in polynomial time
We consider the exploration/exploitation problem in reinforcement learning (RL). The Bayesian approach to model-based RL offers an elegant solution to this problem, by considering...
J. Zico Kolter, Andrew Y. Ng
117
Voted
ICPP
2006
IEEE
15 years 9 months ago
Worst-Case Delay Control in Multi-Group Overlay Networks
This paper proposes a novel and simple adaptive control algorithm for the effective delay control and resource utilization of EMcast when the traffic load becomes heavy in the mu...
Wanqing Tu
147
Voted
ICDM
2009
IEEE
181views Data Mining» more  ICDM 2009»
15 years 1 months ago
Efficient Discovery of Frequent Correlated Subgraph Pairs
The recent proliferation of graph data in a wide spectrum of applications has led to an increasing demand for advanced data analysis techniques. In view of this, many graph mining ...
Yiping Ke, James Cheng, Jeffrey Xu Yu