Sciweavers

998 search results - page 114 / 200
» From Feasible Proofs to Feasible Computations
Sort
View
FPGA
2003
ACM
116views FPGA» more  FPGA 2003»
14 years 2 months ago
Hardware-assisted simulated annealing with application for fast FPGA placement
To truly exploit FPGAs for rapid turn-around development and prototyping, placement times must be reduced to seconds; latebound, reconfigurable computing applications may demand p...
Michael G. Wrighton, André DeHon
GECCO
2010
Springer
150views Optimization» more  GECCO 2010»
14 years 1 months ago
Object-level recombination of commodity applications
This paper presents ObjRecombGA, a genetic algorithm framework for recombining related programs at the object file level. A genetic algorithm guides the selection of object file...
Blair Foster, Anil Somayaji
AI
1998
Springer
14 years 1 months ago
A Hybrid Convergent Method for Learning Probabilistic Networks
During past few years, a variety of methods have been developed for learning probabilistic networks from data, among which the heuristic single link forward or backward searches ar...
Jun Liu, Kuo-Chu Chang, Jing Zhou
ECML
2006
Springer
14 years 19 days ago
Fast Spectral Clustering of Data Using Sequential Matrix Compression
Spectral clustering has attracted much research interest in recent years since it can yield impressively good clustering results. Traditional spectral clustering algorithms first s...
Bo Chen, Bin Gao, Tie-Yan Liu, Yu-Fu Chen, Wei-Yin...
ICRA
1995
IEEE
156views Robotics» more  ICRA 1995»
14 years 15 days ago
Assembly maintainability Study with Motion Planning
Maintainability is an important issue in design where the accessibility of certain parts is determined for routine maintenance. In the past its study has been largely manual and l...
Hsuan Chang, Tsai-Yen Li