Sciweavers

3850 search results - page 288 / 770
» Optimal Linear Broadcast
Sort
View
APPROX
2010
Springer
188views Algorithms» more  APPROX 2010»
15 years 8 months ago
Approximation Algorithms for Reliable Stochastic Combinatorial Optimization
We consider optimization problems that can be formulated as minimizing the cost of a feasible solution wT x over an arbitrary combinatorial feasible set F {0, 1}n . For these pro...
Evdokia Nikolova
SIAMCO
2002
121views more  SIAMCO 2002»
15 years 7 months ago
Consistent Approximations and Approximate Functions and Gradients in Optimal Control
As shown in [7], optimal control problems with either ODE or PDE dynamics can be solved efficiently using a setting of consistent approximations obtained by numerical discretizati...
Olivier Pironneau, Elijah Polak
ICC
2007
IEEE
110views Communications» more  ICC 2007»
16 years 1 months ago
A New STC Structure to Achieve Generalized Optimal Diversity with a Reduced Design Complexity
Abstract - We propose a new space-time code (STC) structure that can achieve generalized optimal diversity (GOD) with a reduced design complexity, and also provide an increased cod...
Moon Il Lee, Seong Keun Oh, Dong Seung Kwon
ISPD
2005
ACM
205views Hardware» more  ISPD 2005»
16 years 25 days ago
Coupling aware timing optimization and antenna avoidance in layer assignment
The sustained progress of VLSI technology has altered the landscape of routing which is a major physical design stage. For timing driven routings, traditional approaches which con...
Di Wu, Jiang Hu, Rabi N. Mahapatra
CORR
2012
Springer
249views Education» more  CORR 2012»
14 years 3 months ago
Computing Cartograms with Optimal Complexity
We show how to compute cartograms with worst-case optimal polygonal complexity. Specifically we study rectilinear duals which are side-contact representations of a planar graph G ...
Md. Jawaherul Alam, Therese C. Biedl, Stefan Felsn...