Sciweavers

2796 search results - page 20 / 560
» The coolest path problem
Sort
View
JAL
2002
71views more  JAL 2002»
14 years 11 months ago
A primal-dual schema based approximation algorithm for the element connectivity problem
The element connectivity problem falls in the category of survivable network design problems { it is intermediate to the versions that ask for edge-disjoint and vertex-disjoint pa...
Kamal Jain, Ion I. Mandoiu, Vijay V. Vazirani, Dav...
ERSA
2009
149views Hardware» more  ERSA 2009»
14 years 9 months ago
Harnessing Human Computation Cycles for the FPGA Placement Problem
Harnessing human computation is an approach to find problem solutions. In this paper, we investigate harnessing this human computation for a Field Programmable Gate Array (FPGA) p...
Luke Terry, Vladimir Roitch, Shoeb Tufail, Kirit S...
WADS
2007
Springer
155views Algorithms» more  WADS 2007»
15 years 5 months ago
Constant Factor Approximations for the Hotlink Assignment Problem
An approach for reducing the navigation effort for the users of a web site is to enhance its hyperlink structure with additional hotlinks. We address the task of adding at most on...
Tobias Jacobs
ICCAD
2009
IEEE
96views Hardware» more  ICCAD 2009»
14 years 9 months ago
PSTA-based branch and bound approach to the silicon speedpath isolation problem
The lack of good "correlation" between pre-silicon simulated delays and measured delays on silicon (silicon data) has spurred efforts on so-called silicon debug. The ide...
Sari Onaissi, Khaled R. Heloue, Farid N. Najm
GECCO
2003
Springer
124views Optimization» more  GECCO 2003»
15 years 5 months ago
Integrated Genetic Algorithm with Hill Climbing for Bandwidth Minimization Problem
In this paper, we propose an integrated Genetic Algorithm with Hill Climbing to solve the matrix bandwidth minimization problem, which is to reduce bandwidth by permuting rows and ...
Andrew Lim, Brian Rodrigues, Fei Xiao