Sciweavers

1930 search results - page 129 / 386
» Learning to Solve QBF
Sort
View
GECCO
2008
Springer
135views Optimization» more  GECCO 2008»
15 years 4 months ago
iBOA: the incremental bayesian optimization algorithm
This paper proposes the incremental Bayesian optimization algorithm (iBOA), which modifies standard BOA by removing the population of solutions and using incremental updates of t...
Martin Pelikan, Kumara Sastry, David E. Goldberg
CORR
2010
Springer
228views Education» more  CORR 2010»
15 years 2 months ago
Sparse Inverse Covariance Selection via Alternating Linearization Methods
Gaussian graphical models are of great interest in statistical learning. Because the conditional independencies between different nodes correspond to zero entries in the inverse c...
Katya Scheinberg, Shiqian Ma, Donald Goldfarb
ICMLA
2010
15 years 1 months ago
An All-at-once Unimodal SVM Approach for Ordinal Classification
Abstract--Support vector machines (SVMs) were initially proposed to solve problems with two classes. Despite the myriad of schemes for multiclassification with SVMs proposed since ...
Joaquim F. Pinto da Costa, Ricardo Sousa, Jaime S....
115
Voted
ICTAI
2007
IEEE
15 years 10 months ago
On Portfolios for Backtracking Search in the Presence of Deadlines
Constraint satisfaction and propositional satisfiability problems are often solved using backtracking search. Previous studies have shown that portfolios of backtracking algorith...
Huayue Wu, Peter van Beek
ACMSE
2006
ACM
15 years 9 months ago
A SAT-based solver for Q-ALL SAT
Although the satisfiability problem (SAT) is NP-complete, state-of-the-art solvers for SAT can solve instances that are considered to be very hard. Emerging applications demand t...
Ben Browning, Anja Remshagen