15485 search results - page 240 / 3097 » Computing Optimal Subsets |
185
click to vote
CSI
2006
15 years 6 months ago
2006
In a distributed system, a number of application tasks may need to be assigned to different processors such that the system cost is minimized and the constraints with limited reso...
178
click to vote
CEC
2008
IEEE
16 years 1 months ago
2008
IEEE
—The particle swarm optimizer (PSO) is a popular computing technique of swarm intelligence, known for its fast convergence speed and easy implementation. All the particles in the...
150
click to vote
TAMC
2010
Springer
15 years 11 months ago
2010
Springer
Unless we resolve the P vs NP question, we are unable to say whether there is an algorithm (acceptor) that accepts Boolean tautologies in polynomial time and does not accept non-ta...
151
click to vote
KDD
2004
ACM
16 years 7 months ago
2004
ACM
A coCluster of a m?n matrix X is a submatrix determined by a subset of the rows and a subset of the columns. The problem of finding coClusters with specific properties is of inter...
175
click to vote
NIPS
1993
15 years 7 months ago
1993
Dynamic programming provides a methodology to develop planners and controllers for nonlinear systems. However, general dynamic programming is computationally intractable. We have ...