1480 search results - page 264 / 296 » Ants can solve constraint satisfaction problems |
DIS
2010
Springer
13 years 9 months ago
2010
Springer
Sequence labeling is the task of assigning a label sequence to an observation sequence. Since many methods to solve this problem depend on the specification of predictive features...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
The structural properties of graphs are usually characterized in terms of invariants, which are functions of graphs that do not depend on the labeling of the nodes. In this paper ...
ICASSP
2011
IEEE
13 years 2 months ago
2011
IEEE
The multiplicative algorithms are well-known for nonnegative matrix and tensor factorizations. The ALS algorithm for canonical decomposition (CP) has been proved as a “workhorse...
AAAI
2012
12 years 1 months ago
2012
To solve the sparsity problem in collaborative filtering, researchers have introduced transfer learning as a viable approach to make use of auxiliary data. Most previous transfer...
MP
2010
13 years 9 months ago
2010
Abstract. We study mixed integer nonlinear programs (MINLP)s that are driven by a collection of indicator variables where each indicator variable controls a subset of the decision ...