Sciweavers

147 search results - page 6 / 30
» Partitioning procedure for polynomial optimization
Sort
View
COLOGNETWENTE
2010
13 years 8 months ago
Complexity of O'Hara's Algorithm
In this paper we analyze O’Hara’s partition bijection. We present three type of results. First, we show that O’Hara’s bijection can be viewed geometrically as a certain sci...
Matjaz Konvalinka, Igor Pak
CORR
2011
Springer
145views Education» more  CORR 2011»
13 years 4 months ago
Global Search Based on Efficient Diagonal Partitions and a set of Lipschitz Constants
In the paper, the global optimization problem of a multidimensional “black-box” function satisfying the Lipschitz condition over a hyperinterval with an unknown Lipschitz const...
Yaroslav D. Sergeyev, Dmitri E. Kvasov
CASES
2003
ACM
14 years 3 months ago
Polynomial-time algorithm for on-chip scratchpad memory partitioning
Focusing on embedded applications, scratchpad memories (SPMs) look like a best-compromise solution when taking into account performance, energy consumption and die area. The main ...
Federico Angiolini, Luca Benini, Alberto Caprara
INFOCOM
2006
IEEE
14 years 3 months ago
Sleeping Coordination for Comprehensive Sensing Using Isotonic Regression and Domatic Partitions
— We address the problem of energy efficient sensing by adaptively coordinating the sleep schedules of sensor nodes while guaranteeing that values of sleeping nodes can be recov...
Farinaz Koushanfar, Nina Taft, Miodrag Potkonjak
CLASSIFICATION
2008
68views more  CLASSIFICATION 2008»
13 years 10 months ago
The Metric Cutpoint Partition Problem
Let G = (V, E, w) be a graph with vertex and edge sets V and E, respectively, and w : E IR+ a function which assigns a positive weight or length to each edge of G. G is called a r...
Alain Hertz, Sacha Varone