Sciweavers

1274 search results - page 75 / 255
» N-fold integer programming
Sort
View
COR
2011
13 years 5 months ago
Faster integer-feasibility in mixed-integer linear programs by branching to force change
Branching in mixed-integer (or integer) linear programming requires choosing both the branching variable and the branching direction. This paper develops a number of new methods f...
Jennifer Pryor, John W. Chinneck
CVPR
2004
IEEE
15 years 14 hour ago
Approximation of Canonical Sets and Their Applications to 2D View Simplification
Given a set of patterns and a similarity measure between them, we will present an optimization framework to approximate a small subset, known as a canonical set, whose members clo...
Trip Denton, Jeff Abrahamson, Ali Shokoufandeh
ICCAD
2007
IEEE
106views Hardware» more  ICCAD 2007»
14 years 7 months ago
A general model for performance optimization of sequential systems
Abstract— Retiming, c-slow retiming and recycling are different transformations for the performance optimization of sequential circuits. For retiming and c-slow retiming, differe...
Dmitry Bufistov, Jordi Cortadella, Michael Kishine...
HYBRID
2009
Springer
14 years 4 months ago
Convergence of Distributed WSN Algorithms: The Wake-Up Scattering Problem
In this paper, we analyze the problem of finding a periodic schedule for the wake-up times of a set of nodes in a Wireless Sensor Network that optimizes the coverage of the region...
Daniele Fontanelli, Luigi Palopoli, Roberto Passer...
CPAIOR
2009
Springer
14 years 4 months ago
The Polytope of Context-Free Grammar Constraints
Context-free grammar constraints enforce that a sequence of variables forms a word in a language defined by a context-free grammar. The constraint has received a lot of attention ...
Gilles Pesant, Claude-Guy Quimper, Louis-Martin Ro...