Sciweavers

2477 search results - page 100 / 496
» Approximate extended formulations
Sort
View
PLDI
2012
ACM
13 years 6 months ago
Proving acceptability properties of relaxed nondeterministic approximate programs
Approximate program transformations such as skipping tasks [29, 30], loop perforation [21, 22, 35], reduction sampling [38], multiple selectable implementations [3, 4, 16, 38], dy...
Michael Carbin, Deokhwan Kim, Sasa Misailovic, Mar...
CVPR
1999
IEEE
16 years 6 months ago
Factorization as a Rank 1 Problem
Tomasi and Kanade [1] introduced the factorization method for recovering 3D structure from 2D video. In their formulation, the 3D shape and 3D motion are computed by using an SVD ...
Pedro M. Q. Aguiar, José M. F. Moura
SAGA
2005
Springer
15 years 9 months ago
Dynamic Facility Location with Stochastic Demands
Abstract. In this paper, a Stochastic Dynamic Facility Location Problem (SDFLP) is formulated. In the first part, an exact solution method based on stochastic dynamic programming ...
Martin Romauch, Richard F. Hartl
WEA
2005
Springer
100views Algorithms» more  WEA 2005»
15 years 9 months ago
Rounding to an Integral Program
We present a general framework for approximating several NP-hard problems that have two underlying properties in common. First, the problems we consider can be formulated as intege...
Refael Hassin, Danny Segev
ISCAS
2002
IEEE
130views Hardware» more  ISCAS 2002»
15 years 9 months ago
Analysis of limit cycle stability in a tap-changing transformer
The paper analyses the nature of limit cycles induced through the interaction of transformer tap changing and load dynamics. Linearization of a Poincar´e map is used to prove loc...
Vaibhav Donde, Ian A. Hiskens