Sciweavers

743 search results - page 63 / 149
» Optimal Abstraction on Real-Valued Programs
Sort
View
FSTTCS
2004
Springer
15 years 3 months ago
Improved Approximation Algorithms for Maximum Graph Partitioning Problems
Abstract Abstract. In this paper we improve the analysis of approximation algorithms based on semidefinite programming for the maximum graph partitioning problems MAX-k-CUT, MAX-k...
Gerold Jäger, Anand Srivastav
JISE
2006
76views more  JISE 2006»
14 years 10 months ago
Process and Planning Support for Iterative Porting
in an abstract Cartesian space of program versions characterized by dialect variables. An optimal solution to the problem is derived based on its translation to a restricted Intege...
Pradeep Varma
HYBRID
2009
Springer
15 years 4 months ago
Safe and Secure Networked Control Systems under Denial-of-Service Attacks
Abstract. We consider the problem of security constrained optimal control for discrete-time, linear dynamical systems in which control and measurement packets are transmitted over ...
Saurabh Amin, Alvaro A. Cárdenas, Shankar S...
CP
2005
Springer
15 years 3 months ago
Sub-optimality Approximations
Abstract. The sub-optimality approximation problem considers an optimization problem O, its optimal solution σ∗ , and a variable x with domain {d1, . . . , dm} and returns appro...
Russell Bent, Irit Katriel, Pascal Van Hentenryck
EOR
2007
113views more  EOR 2007»
14 years 9 months ago
Duality for location problems with unbounded unit balls
Abstract. Given an optimization problem with a composite of a convex and componentwise increasing function with a convex vector function as objective function, by means of the conj...
Gert Wanka, Radu Ioan Bot, Emese Vargyas