Sciweavers

986 search results - page 101 / 198
» Algorithmic Lower Bounds for Problems Parameterized by Cliqu...
Sort
View
COCO
2005
Springer
72views Algorithms» more  COCO 2005»
15 years 11 months ago
Toward a Model for Backtracking and Dynamic Programming
We propose a model called priority branching trees (pBT ) for backtracking and dynamic programming algorithms. Our model generalizes both the priority model of Borodin, Nielson an...
Michael Alekhnovich, Allan Borodin, Joshua Buresh-...
CCE
2006
15 years 6 months ago
Global optimization for the synthesis of integrated water systems in chemical processes
In this paper, we address the problem of optimal synthesis of an integrated water system, where water using processes and water treatment operations are combined into a single net...
Ramkumar Karuppiah, Ignacio E. Grossmann
ICALP
2003
Springer
15 years 11 months ago
Analysis of a Simple Evolutionary Algorithm for Minimization in Euclidean Spaces
Although evolutionary algorithms (EAs) are widely used in practical optimization, their theoretical analysis is still in its infancy. Up to now results on the (expected) runtime ar...
Jens Jägersküpper
ICASSP
2011
IEEE
14 years 10 months ago
A robust clock synchronization algorithm for wireless sensor networks
Recently, the maximum likelihood estimator (MLE) and Cramer-Rao Lower Bound (CRLB) were proposed with the goal of maximizing and assessing the synchronization accuracy in wireless...
Jang-Sub Kim, Jaehan Lee, Erchin Serpedin, Khalid ...
ICCAD
1997
IEEE
101views Hardware» more  ICCAD 1997»
15 years 10 months ago
Minimum area retiming with equivalent initial states
Traditional minimum area retiming algorithms attempt to achieve their prescribed objective with no regard to maintaining the initial state of the system. This issue is important f...
Naresh Maheshwari, Sachin S. Sapatnekar