2244 search results - page 71 / 449 » A new heuristic approach for non-convex optimization problem... |
149
click to vote
MTV
2003
IEEE
15 years 11 months ago
2003
IEEE
In recent years backtrack search SAT solvers have been the subject of dramatic improvements. These improvements allowed SAT solvers to successfully replace BDDs in many areas of f...
177
click to vote
JVA
2006
IEEE
16 years 5 days ago
2006
IEEE
Grid computing is a form of distributed computing that involves coordinating and sharing computing, application, data storage or network resources across dynamic and geographicall...
156
click to vote
ASIAMS
2008
IEEE
16 years 19 days ago
2008
IEEE
The multiobjective Quadratic Assignment Problem (mQAP) is considered as one of the hardest optimization problems but with many real-world applications. Since it may not be possibl...
185
click to vote
COLOGNETWENTE
2010
15 years 2 months ago
2010
Given a bipartite graph G = (S, T, E), we consider the problem of finding k bipartite subgraphs, called "clusters", such that each vertex i of S appears in exactly one o...
156
click to vote
ICML
2006
IEEE
16 years 7 months ago
2006
IEEE
We consider the problem of clustering in its most basic form where only a local metric on the data space is given. No parametric statistical model is assumed, and the number of cl...