Sciweavers

386 search results - page 17 / 78
» A Heuristic for Nonlinear Global Optimization
Sort
View
ICS
2001
Tsinghua U.
14 years 1 months ago
Global optimization techniques for automatic parallelization of hybrid applications
This paper presents a novel technique to perform global optimization of communication and preprocessing calls in the presence of array accesses with arbitrary subscripts. Our sche...
Dhruva R. Chakrabarti, Prithviraj Banerjee
ICIP
2006
IEEE
14 years 10 months ago
Dead-End Elimination as a Heuristic for Min-Cut Image Segmentation
We apply the dead-end elimination (DEE) strategy from protein design as a heuristic for the max-flow/min-cut formulation of the image segmentation problem. DEE combines aspects of...
Mala L. Radhakrishnan, Sara L. Su
ICDE
2008
IEEE
123views Database» more  ICDE 2008»
14 years 10 months ago
Handling Non-linear Polynomial Queries over Dynamic Data
Applications that monitor functions over rapidly and unpredictably changing data, express their needs as continuous queries. Our focus is on a rich class of queries, expressed as p...
Shetal Shah, Krithi Ramamritham
MP
2007
102views more  MP 2007»
13 years 8 months ago
Elastic-mode algorithms for mathematical programs with equilibrium constraints: global convergence and stationarity properties
The elastic-mode formulation of the problem of minimizing a nonlinear function subject to equilibrium constraints has appealing local properties in that, for a finite value of the...
Mihai Anitescu, Paul Tseng, Stephen J. Wright
ITC
1999
IEEE
107views Hardware» more  ITC 1999»
14 years 27 days ago
A high-level BIST synthesis method based on a region-wise heuristic for an integer linear programming
A high-level built-in self-test (BIST) synthesis involves several tasks such as system register assignment, interconnection assignment, and BIST register assignment. Existing high...
Han Bin Kim, Dong Sam Ha