2244 search results - page 84 / 449 » A new heuristic approach for non-convex optimization problem... |
159
click to vote
SIAMJO
2010
15 years 28 days ago
2010
Owing to their high accuracy and ease of formulation, there has been great interest in applying convex optimization techniques, particularly that of semidefinite programming (SDP)...
175
click to vote
EAAI
2007
15 years 6 months ago
2007
Multi-agent systems are widely used to address large-scale distributed combinatorial applications in the real world. One such application is meeting scheduling (MS), which is de�...
127
click to vote
ICML
2010
IEEE
15 years 7 months ago
2010
IEEE
Optimization problems with a nuclear norm regularization, such as e.g. low norm matrix factorizations, have seen many applications recently. We propose a new approximation algorit...
151
click to vote
GECCO
2005
Springer
15 years 11 months ago
2005
Springer
This paper presents an ant-based approach for solving the Traveling Salesman Problem (TSP). Novel concepts of this algorithm that distinguish it from the other heuristics are the ...
256
click to vote
SIGMOD
2005
ACM
16 years 6 months ago
2005
ACM
In recent years there has been considerable research on automated selection of physical design in database systems. In current solutions, candidate access paths are heuristically ...