403 search results - page 45 / 81 » Variable ranges in linear constraints |
79
Voted
JISE
2006
15 years 10 days ago
2006
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...
106
click to vote
COLT
1997
Springer
15 years 4 months ago
1997
Springer
Abstract. We propose a convex optimization approach to solving the nonparametric regression estimation problem when the underlying regression function is Lipschitz continuous. This...
82
Voted
IEEECIT
2006
IEEE
15 years 6 months ago
2006
IEEE
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 ...
96
Voted
RISE
2004
Springer
15 years 5 months ago
2004
Springer
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...
117
Voted
OL
2011
14 years 3 months ago
2011
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 ...