Sciweavers

639 search results - page 11 / 128
» Integer Programming Models for Optimization Problems in Test...
Sort
View
CASES
2006
ACM
15 years 5 months ago
Memory optimization by counting points in integer transformations of parametric polytopes
Memory size reduction and memory accesses optimization are crucial issues for embedded systems. In the context of affine programs, these two challenges are classically tackled by ...
Rachid Seghir, Vincent Loechner
VLSID
2002
IEEE
98views VLSI» more  VLSID 2002»
16 years 1 days ago
On Test Scheduling for Core-Based SOCs
We present a mathematical model for the problem of scheduling tests for core-based system-on-chip (SOC) VLSI designs. Given a set of tests for each core in the SOC and a set of te...
Sandeep Koranne
107
Voted
MP
2007
95views more  MP 2007»
14 years 11 months ago
Smoothed analysis of integer programming
We present a probabilistic analysis of integer linear programs (ILPs). More specifically, we study ILPs in a so-called smoothed analysis in which it is assumed that first an adve...
Heiko Röglin, Berthold Vöcking
OL
2007
156views more  OL 2007»
14 years 11 months ago
A trust region SQP algorithm for mixed-integer nonlinear programming
We propose a modified sequential quadratic programming (SQP) method for solving mixed-integer nonlinear programming problems. Under the assumption that integer variables have a s...
Oliver Exler, Klaus Schittkowski
85
Voted
CPAIOR
2007
Springer
15 years 5 months ago
Best-First AND/OR Search for 0/1 Integer Programming
Abstract. AND/OR search spaces are a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is its sensitivity to the struc...
Radu Marinescu 0002, Rina Dechter