Sciweavers

5 search results - page 1 / 1
» An algorithm for automated closure during assembly
Sort
View
BMCBI
2010
154views more  BMCBI 2010»
13 years 4 months ago
An algorithm for automated closure during assembly
Background: Finishing is the process of improving the quality and utility of draft genome sequences generated by shotgun sequencing and computational assembly. Finishing can invol...
Sergey Koren, Jason R. Miller, Brian Walenz, Grang...
ICRA
1994
IEEE
75views Robotics» more  ICRA 1994»
13 years 8 months ago
Planning for Modular and Hybrid Fixtures
Fixturing encompasses the design and assembly of fixtures to locate and hold a workpiece during a manufacturing operation such as machining or assembly. We have implemented an auto...
Aaron S. Wallack, John F. Canny
CSL
2008
Springer
13 years 6 months ago
Syntactic Metatheory of Higher-Order Subtyping
Abstract. We present a new proof of decidability of higher-order subtyping in the presence of bounded quantification. The algorithm is formulated as a judgement which operates on b...
Andreas Abel, Dulma Rodriguez
DAC
2007
ACM
14 years 5 months ago
IPR: An Integrated Placement and Routing Algorithm
Abstract-- In nanometer-scale VLSI technologies, several interconnect issues like routing congestion and interconnect delay have become the main concerns in placement. However, all...
Min Pan, Chris C. N. Chu
IAT
2006
IEEE
13 years 10 months ago
Strategic Issues in Trading Agent Competition: TAC-Classic
With the advancement of Internet Technology, increasing number of electronic marketplaces and online auction houses provides real-time transaction services for buyers and sellers ...
Francisco Oliveira, Yain-Whar Si