1483 search results - page 168 / 297 » Geometric constraint satisfaction using optimization methods |
104
click to vote
IEEEPACT
2009
IEEE
15 years 8 months ago
2009
IEEE
Abstract—Load elimination is a classical compiler transformation that is increasing in importance for multi-core and many-core architectures. The effect of the transformation is ...
112
click to vote
ICML
1998
IEEE
16 years 2 months ago
1998
IEEE
This paper introduces a new algorithm, Q2, foroptimizingthe expected output ofamultiinput noisy continuous function. Q2 is designed to need only a few experiments, it avoids stron...
104
click to vote
ICC
2008
IEEE
15 years 7 months ago
2008
IEEE
—This paper concerns the problem of finding the minimum-length TDMA frame of a power-controlled wireless network subject to traffic demands and SINR (signalto-interference-plus...
127
click to vote
VISUALIZATION
1997
IEEE
15 years 5 months ago
1997
IEEE
This paper presents a framework for multiresolution compression and geometric reconstruction of arbitrarily dimensioned data designed for distributed applications. Although being ...
112
click to vote
CPAIOR
2010
Springer
15 years 4 months ago
2010
Springer
Cutting plane methods are widely used for solving convex optimization problems and are of fundamental importance, e.g., to provide tight bounds for Mixed-Integer Programs (MIPs). T...