6562 search results - page 144 / 1313 » Noetherianity and Combination Problems |
165
click to vote
TKDE
2008
15 years 6 months ago
2008
Matrix decomposition methods represent a data matrix as a product of two smaller matrices: one containing basis vectors that represent meaningful concepts in the data, and another ...
169
click to vote
SODA
2010
ACM
16 years 3 months ago
2010
ACM
The class of constraint satisfactions problems (CSPs) captures many fundamental combinatorial optimization problems such as Max Cut, Max q-Cut, Unique Games, and Max k-Sat. Recent...
152
click to vote
CEC
2008
IEEE
16 years 17 days ago
2008
IEEE
Abstract— This paper presents a new efficient multiobjective evolutionary algorithm for solving computationallyintensive optimization problems. To support a high degree of parall...
163
click to vote
CISS
2008
IEEE
16 years 17 days ago
2008
IEEE
Abstract—To achieve higher reliability, safety, and faulttolerance, many mission-critical detection and decision systems implement consensus algorithms that force the systems’ ...
147
click to vote
CPAIOR
2007
Springer
16 years 8 days ago
2007
Springer
In a facility with front room and back room operations, it is useful to switch workers between the rooms in order to cope with changing customer demand. Assuming stochastic custome...