Sciweavers

1494 search results - page 51 / 299
» Kernels for Global Constraints
Sort
View
EUROPAR
2006
Springer
14 years 21 days ago
Multi-dimensional Kernel Generation for Loop Nest Software Pipelining
Single-dimension Software Pipelining (SSP) has been proposed as an effective software pipelining technique for multi-dimensional loops [16]. This paper introduces for the first tim...
Alban Douillet, Hongbo Rong, Guang R. Gao
AAAI
2008
13 years 11 months ago
Loop Formulas for Logic Programs with Arbitrary Constraint Atoms
We formulate loop formulas for logic programs with arbitrary constraint atoms, for the semantics based on conditional satisfaction. This provides a method for answer set computati...
Jia-Huai You, Guohua Liu
ISCAS
2006
IEEE
110views Hardware» more  ISCAS 2006»
14 years 3 months ago
Network-on-chip link analysis under power and performance constraints
— This paper analyzes the behavior of interconnects in the highly structured environment of a network-on-chip (NoC). Two distinct classes of wires are considered, namely links be...
Manho Kim, Daewook Kim, Gerald E. Sobelman
JGO
2008
83views more  JGO 2008»
13 years 9 months ago
Global minimization of rational functions and the nearest GCDs
This paper discusses the global minimization of rational functions with or without constraints. We studied the sum of squares (SOS) relaxations and their properties to solve this ...
Jiawang Nie, James Demmel, Ming Gu
COCOS
2003
Springer
148views Optimization» more  COCOS 2003»
14 years 2 months ago
Convex Programming Methods for Global Optimization
We investigate some approaches to solving nonconvex global optimization problems by convex nonlinear programming methods. We assume that the problem becomes convex when selected va...
John N. Hooker