Sciweavers

135 search results - page 16 / 27
» Efficiently Solving the Fractional Trust Region Problem
Sort
View
IPPS
2010
IEEE
14 years 7 months ago
Large neighborhood local search optimization on graphics processing units
Local search (LS) algorithms are among the most powerful techniques for solving computationally hard problems in combinatorial optimization. These algorithms could be viewed as &q...
Thé Van Luong, Nouredine Melab, El-Ghazali ...
ASPDAC
2005
ACM
107views Hardware» more  ASPDAC 2005»
14 years 11 months ago
Substrate resistance extraction with direct boundary element method
- It is important to model the substrate coupling for mixed-signal circuit designs today. This paper presents the direct boundary element method (BEM) for substrate resistance calc...
Xiren Wang, Wenjian Yu, Zeyi Wang
AAAI
2010
14 years 11 months ago
SixthSense: Fast and Reliable Recognition of Dead Ends in MDPs
The results of the latest International Probabilistic Planning Competition (IPPC-2008) indicate that the presence of dead ends, states with no trajectory to the goal, makes MDPs h...
Andrey Kolobov, Mausam, Daniel S. Weld
ICPR
2006
IEEE
15 years 10 months ago
Fingerprint Matching Method Using Minutiae Clustering and Warping
Solving non-linear distortion problems in fingerprint matching is important and still remains as a challenging topic. We have developed a new fingerprint matching method to deal w...
Dongjin Kwon, Duck Hoon Kim, Il Dong Yun, Sang Uk ...
82
Voted
CCE
2004
14 years 9 months ago
Computational studies using a novel simplicial-approximation based algorithm for MINLP optimization
Significant advances have been made in the last two decades for the effective solution of mixed integer non-linear programming (MINLP) problems, mainly by exploiting the special s...
Vishal Goyal, Marianthi G. Ierapetritou