Sciweavers

80 search results - page 5 / 16
» Integer Programming Subject to Monomial Constraints
Sort
View
ORDER
2008
100views more  ORDER 2008»
13 years 7 months ago
Orthogonal Surfaces and Their CP-Orders
Orthogonal surfaces are nice mathematical objects which have interesting connections to various fields, e.g., integer programming, monomial ideals and order dimension. While orthog...
Stefan Felsner, Sarah Kappes
EOR
2010
113views more  EOR 2010»
13 years 7 months ago
Optimal solutions for unrelated parallel machines scheduling problems using convex quadratic reformulations
We consider the unrelated parallel machines scheduling problem where jobs have earliness and tardiness penalties and a common due date. We formulate this problem and some of its v...
Marie-Christine Plateau, Yasmin A. Rios-Solis
CP
2007
Springer
14 years 1 months ago
A Generic Geometrical Constraint Kernel in Space and Time for Handling Polymorphic k-Dimensional Objects
: This report introduces a geometrical constraint kernel for handling the location in space and time of polymorphic k-dimensional objects subject to various geometrical and time co...
Nicolas Beldiceanu, Mats Carlsson, Emmanuel Poder,...
CODES
2005
IEEE
14 years 1 months ago
Satisfying real-time constraints with custom instructions
Instruction-set extensible processors allow an existing processor core to be extended with application-specific custom instructions. In this paper, we explore a novel application...
Pan Yu, Tulika Mitra
ISCAS
2006
IEEE
145views Hardware» more  ISCAS 2006»
14 years 1 months ago
The wordlength determination problem of linear time invariant systems with multiple outputs - a geometric programming approach
This paper proposes two new methods for optimizing objectives and constraints. The GP approach is very general and hardware resources in finite wordlength implementation of it allo...
S. C. Chan, K. M. Tsui