Sciweavers

2152 search results - page 84 / 431
» A Comparative Study of 2QBF Algorithms
Sort
View
COLT
2008
Springer
15 years 5 months ago
Regret Bounds for Sleeping Experts and Bandits
We study on-line decision problems where the set of actions that are available to the decision algorithm vary over time. With a few notable exceptions, such problems remained larg...
Robert D. Kleinberg, Alexandru Niculescu-Mizil, Yo...
111
Voted
PARA
1994
Springer
15 years 8 months ago
Parallel Computation of the Eigenstructure of Toeplitz-plus-Hankel Matrices on Multicomputers
In this paper we present four parallel algorithms to compute any group of eigenvalues and eigenvectors of a Toeplitz-plus-Hankel matrix. These algorithms parallelize a method that...
José M. Badía, Antonio M. Vidal
135
Voted
LICS
1999
IEEE
15 years 8 months ago
Subtyping Recursive Types in Kernel Fun
The problem of defining and checking a subtype relation between recursive types was studied in [3] for a first order type system, but for second order systems, which combine subty...
Dario Colazzo, Giorgio Ghelli
TEC
2010
112views more  TEC 2010»
14 years 10 months ago
Population-Based Algorithm Portfolios for Numerical Optimization
In this paper, we consider the scenario that a population-based algorithm is applied to a numerical optimization problem and a solution needs to be presented within a given time bu...
Fei Peng, Ke Tang, Guoliang Chen, Xin Yao
180
Voted
SPAA
1997
ACM
15 years 8 months ago
A Localized Algorithm for Parallel Association Mining
Discovery of association rules is an important database mining problem. Mining for association rules involves extracting patterns from large databases and inferring useful rules f...
Mohammed Javeed Zaki, Srinivasan Parthasarathy, We...