Sciweavers

16093 search results - page 54 / 3219
» On the optimality of the neighbor-joining algorithm
Sort
View
CC
2007
Springer
107views System Software» more  CC 2007»
15 years 7 months ago
A Fast Cutting-Plane Algorithm for Optimal Coalescing
Abstract. Recent work has shown that the subtasks of register allocation (spilling, register assignment, and coalescing) can be completely separated. This work presents an algorith...
Daniel Grund, Sebastian Hack
CEC
2010
IEEE
15 years 1 months ago
The differential Ant-Stigmergy Algorithm for large-scale global optimization
— Ant-colony optimization (ACO) is a popular swarm intelligence metaheuristic scheme that can be applied to almost any optimization problem. In this paper, we address a performan...
Peter Korosec, Katerina Taskova, Jurij Silc
SIAMJO
2011
14 years 8 months ago
A Unifying Polyhedral Approximation Framework for Convex Optimization
Abstract. We propose a unifying framework for polyhedral approximation in convex optimization. It subsumes classical methods, such as cutting plane and simplicial decomposition, bu...
Dimitri P. Bertsekas, Huizhen Yu
SIAMNUM
2010
99views more  SIAMNUM 2010»
14 years 8 months ago
Analysis and Optimization of Robin-Robin Partitioned Procedures in Fluid-Structure Interaction Problems
In the solution of Fluid-Structure Interaction problems, partitioned procedures are modular algorithms that involve separate fluid and structure solvers, that interact, in an itera...
Luca Gerardo-Giorda, Fabio Nobile, Christian Verga...
TSP
2010
14 years 8 months ago
A dual perspective on separable semidefinite programming with applications to optimal downlink beamforming
This paper considers the downlink beamforming optimization problem that minimizes the total transmission power subject to global shaping constraints and individual shaping constrai...
Yongwei Huang, Daniel Pérez Palomar