Sciweavers

4860 search results - page 638 / 972
» SNPs Problems, Complexity, and Algorithms
Sort
View
DATE
2008
IEEE
78views Hardware» more  DATE 2008»
16 years 1 months ago
Simultaneous FU and Register Binding Based on Network Flow Method
– With the rapid increase of design complexity and the decrease of device features in nano-scale technologies, interconnection optimization in digital systems becomes more and mo...
Jason Cong, Junjuan Xu
IROS
2007
IEEE
158views Robotics» more  IROS 2007»
16 years 29 days ago
Factor-guided motion planning for a robot arm
— Motion planning for robotic arms is important for real, physical world applications. The planning for arms with high-degree-of-freedom (DOF) is hard because its search space is...
Jaesik Choi, Eyal Amir
ESOP
2007
Springer
16 years 25 days ago
Computing Procedure Summaries for Interprocedural Analysis
Abstract. We describe a new technique for computing procedure summaries for performing an interprocedural analysis on programs. Procedure summaries are computed by performing a bac...
Sumit Gulwani, Ashish Tiwari
GECCO
2007
Springer
189views Optimization» more  GECCO 2007»
16 years 25 days ago
A more bio-plausible approach to the evolutionary inference of finite state machines
With resemblance of finite-state machines to some biological mechanisms in cells and numerous applications of finite automata in different fields, this paper uses analogies an...
Hooman Shayani, Peter J. Bentley
WABI
2007
Springer
139views Bioinformatics» more  WABI 2007»
16 years 23 days ago
Computability of Models for Sequence Assembly
Graph-theoretic models have come to the forefront as some of the most powerful and practical methods for sequence assembly. Simultaneously, the computational hardness of the underl...
Paul Medvedev, Konstantinos Georgiou, Gene Myers, ...