2899 search results - page 116 / 580 » On the Complexity of Exclusion Algorithms for Optimization |
104
click to vote
DAC
2009
ACM
16 years 2 months ago
2009
ACM
In this paper, we propose an effective algorithm flow to handle largescale mixed-size placement. The basic idea is to use floorplanning to guide the placement of objects at the gl...
138
click to vote
WAOA
2005
Springer
15 years 7 months ago
2005
Springer
Given a graph with a source and a sink node, the NP–hard maximum k–splittable flow (MkSF) problem is to find a flow of maximum value with a flow decomposition using at most...
ICC
2007
IEEE
15 years 8 months ago
2007
IEEE
— In this paper, we study how to appropriately match users for two-user cooperative diversity systems that deploy optimal power allocation for an amplify and forward or a regener...
111
click to vote
ICML
2009
IEEE
16 years 2 months ago
2009
IEEE
The general stochastic optimal control (SOC) problem in robotics scenarios is often too complex to be solved exactly and in near real time. A classical approximate solution is to ...
117
click to vote
SIGGRAPH
1996
ACM
15 years 5 months ago
1996
ACM
A number of techniques have been developed for reconstructing surfaces by integrating groups of aligned range images. A desirable set of properties for such algorithms includes: i...