Sciweavers

1165 search results - page 142 / 233
» Effective linear programming based placement methods
Sort
View
IJAIT
2006
121views more  IJAIT 2006»
15 years 2 months ago
An Efficient Feature Selection Algorithm for Computer-aided Polyp Detection
We present an efficient feature selection algorithm for computer aided detection (CAD) computed tomographic (CT) colonography. The algorithm 1) determines an appropriate piecewise...
Jiang Li, Jianhua Yao, Ronald M. Summers, Nicholas...
LCTRTS
2009
Springer
15 years 9 months ago
A compiler optimization to reduce soft errors in register files
Register file (RF) is extremely vulnerable to soft errors, and traditional redundancy based schemes to protect the RF are prohibitive not only because RF is often in the timing c...
Jongeun Lee, Aviral Shrivastava
ICCS
2004
Springer
15 years 8 months ago
Routing and Wavelength Assignments in Optical WDM Networks with Maximum Quantity of Edge Disjoint Paths
In the present paper routing and wavelength assignment (RWA) in optical WDM networks is discussed. Previous techniques on based on the integer linear programming and graph coloring...
Hyunseung Choo, Vladimir V. Shakhov
ISSS
1997
IEEE
109views Hardware» more  ISSS 1997»
15 years 7 months ago
Reducing the Complexity of ILP Formulations for Synthesis
Integer Linear Programming ILP is commonly used in high level and system level synthesis. It is an NP-Complete problem in general cases. There exists some tools that give an o...
Anne Mignotte, Olivier Peyran
IPCO
2008
118views Optimization» more  IPCO 2008»
15 years 4 months ago
Constraint Orbital Branching
Orbital branching is a method for branching on variables in integer programming that reduces the likelihood of evaluating redundant, isomorphic nodes in the branch-and-bound proce...
James Ostrowski, Jeff Linderoth, Fabrizio Rossi, S...