نتایج جستجو برای: guillotine cutting

تعداد نتایج: 40559  

Journal: :Annals of Surgery 1919

Journal: :Proceedings of the National Academy of Sciences of the United States of America 2017
Lucas R Blauch Ya Gai Jian Wei Khor Pranidhi Sood Wallace F Marshall Sindy K Y Tang

Wound repair is a key feature distinguishing living from nonliving matter. Single cells are increasingly recognized to be capable of healing wounds. The lack of reproducible, high-throughput wounding methods has hindered single-cell wound repair studies. This work describes a microfluidic guillotine for bisecting single Stentor coeruleus cells in a continuous-flow manner. Stentor is used as a m...

Journal: :Computers & Industrial Engineering 2011
Plácido Rogério Pinheiro André L. V. Coelho Alexei Barbosa de Aguiar Tibérius O. Bonates

The Generate-and-Solve (GS) methodology is a hybrid method that combines a metaheuristic component with an exact solver. GS has been recently introduced in the literature in order to solve cutting and packing problems, showing promising results. The GS framework includes a metaheuristic engine (e.g., a genetic algorithm) that works as a generator of reduced instances of the original optimizatio...

2015
Frederico Dusberger Günther R. Raidl

Cutting and packing problems occur in many real-world applications such as industrial glass, paper or steel cutting, container loading and VLSI design [1]. In this work we consider in particular the two-dimensional cutting stock problem with variable sheet size (2CSV) in which we are given a set of nE rectangular element types E = {1, . . . , nE}, each i ∈ E specified by a height hi ∈ N, a widt...

1998
Claire Kenyon

We present an asymptotic fully polynomial approximation scheme for strip-packing, or packing rectangles into a rectangle of xed width and minimum height, a classical NP-hard cutting-stock problem. The algorithm nds a packing of n rectangles whose total height is within a factor of (1 +) of optimal (up to an additive term), and has running time polynomial both in n and in 1==. It is based on a r...

Journal: :Annals OR 2000
Víctor Parada Rodrigo Palma Daniel Sales Arlindo Gómes

Victor Parada a,∗, Rodrigo Palma a, Daniel Sales b and Arlindo Gómes c a Departamento de Ingeniería Informática, Universidad de Santiago de Chile, Av. Ecuador 3659, Santiago, Chile E-mail: [email protected] b Departamento de Ingeniería Eléctrica, Universidad de Santiago de Chile, Av. Ecuador 3659, Santiago, Chile c Departamento de Informática, Universidad Federal de Espı́rito Santo, Campus ...

Journal: :Techniques & culture 2019

Journal: :Inf. Process. Lett. 2006
Eyal Ackerman Gill Barequet Ron Y. Pinter Dan Romik

Guillotine partitions play an important role in many research areas and application domains, e.g., computational geometry, computer graphics, integrated circuit layout, and solid modeling, to mention just a few. In this paper we present an exact summation formula for the number of structurally-different guillotine partitions in d dimensions by n hyperplanes, and then show that it is Θ (( 2d− 1 ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید