Sciweavers

403 search results - page 45 / 81
» Variable ranges in linear constraints
Sort
View
JISE
2006
76views more  JISE 2006»
13 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
COLT
1997
Springer
14 years 3 months ago
Estimation of Time-Varying Parameters in Statistical Models: An Optimization Approach
Abstract. We propose a convex optimization approach to solving the nonparametric regression estimation problem when the underlying regression function is Lipschitz continuous. This...
Dimitris Bertsimas, David Gamarnik, John N. Tsitsi...
IEEECIT
2006
IEEE
14 years 4 months ago
ILP-based Scheduling for Asynchronous Circuits in Bundled-Data Implementation
In this paper, we propose a new scheduling method for asynchronous circuits in bundled-data implementation. The method is based on integer linear programming (ILP) which explores ...
Hiroshi Saito, Nattha Jindapetch, Tomohiro Yoneda,...
RISE
2004
Springer
14 years 4 months ago
A Symbolic Model Checker for tccp Programs
In this paper, we develop a symbolic representation for timed concurrent constraint (tccp) programs, which can be used for defining a lightweight model–checking algorithm for re...
María Alpuente, Moreno Falaschi, Alicia Vil...
OL
2011
177views Neural Networks» more  OL 2011»
13 years 1 months ago
Exploiting vector space properties to strengthen the relaxation of bilinear programs arising in the global optimization of proce
In this paper we present a methodology for finding tight convex relaxations for a special set of quadratic constraints given by bilinear and linear terms that frequently arise in ...
Juan P. Ruiz, Ignacio E. Grossmann