3367 search results - page 111 / 674 » Incremental assignment problem |
134
click to vote
CONSTRAINTS
2010
15 years 12 days ago
2010
Abstract. Propositional satisfiability (SAT) is a success story in Computer Science and Artificial Intelligence: SAT solvers are currently used to solve problems in many different ...
159
click to vote
ESA
2011
Springer
14 years 2 months ago
2011
Springer
We present a number of positive and negative results for variants of the matroid secretary problem. Most notably, we design a constant-factor competitive algorithm for the “rando...
116
click to vote
CEC
2009
IEEE
15 years 9 months ago
2009
IEEE
— The population-based incremental learning (PBIL) algorithm is a combination of evolutionary optimization and competitive learning. Recently, the PBIL algorithm has been applied...
121
click to vote
ICPR
2008
IEEE
15 years 9 months ago
2008
IEEE
Nonnegative matrix factorization (NMF) has been shown to be an efficient clustering tool. However, NMF`s batch nature necessitates recomputation of whole basis set for new samples...
115
click to vote
ICCSA
2004
Springer
15 years 8 months ago
2004
Springer
Finding the fastest algorithm to solve a problem is one of the main issues in Computational Geometry. Focusing only on worst case analysis or asymptotic computations leads to the d...