Sciweavers

55 search results - page 1 / 11
» Local and Global Complete Solution Learning Methods for QBF
Sort
View
SAT
2005
Springer
107views Hardware» more  SAT 2005»
13 years 10 months ago
Local and Global Complete Solution Learning Methods for QBF
Solvers for Quantified Boolean Formulae (QBF) use many analogues of technique from SAT. A significant amount of work has gone into extending conflict based techniques such as co...
Ian P. Gent, Andrew G. D. Rowley
ICIP
2008
IEEE
13 years 11 months ago
Globally optimal solution to exploit rigidity when recovering structure from motion under occlusion
Widely used SVD-based matrix factorization approaches to the recovery of 3D rigid structure from motion (SFM), require a set of feature points to be visible in a set of images. Wh...
Pedro M. Q. Aguiar, João M. F. Xavier, Mark...
MEMETIC
2010
311views more  MEMETIC 2010»
12 years 11 months ago
Iterated local search with Powell's method: a memetic algorithm for continuous global optimization
In combinatorial solution spaces Iterated Local Search (ILS) turns out to be exceptionally successful. The question arises: is ILS also capable of improving the optimization proces...
Oliver Kramer
ICDM
2008
IEEE
110views Data Mining» more  ICDM 2008»
13 years 11 months ago
Start Globally, Optimize Locally, Predict Globally: Improving Performance on Imbalanced Data
Class imbalance is a ubiquitous problem in supervised learning and has gained wide-scale attention in the literature. Perhaps the most prevalent solution is to apply sampling to t...
David A. Cieslak, Nitesh V. Chawla
ATAL
2003
Springer
13 years 9 months ago
An asynchronous complete method for distributed constraint optimization
We present a new polynomial-space algorithm, called Adopt, for distributed constraint optimization (DCOP). DCOP is able to model a large class of collaboration problems in multi-a...
Pragnesh Jay Modi, Wei-Min Shen, Milind Tambe, Mak...