Sciweavers

2597 search results - page 225 / 520
» On numbers of Davenport-Schinzel sequences
Sort
View
CORR
2006
Springer
105views Education» more  CORR 2006»
15 years 1 months ago
Reducing Tile Complexity for Self-Assembly Through Temperature Programming
We consider the tile self-assembly model and how tile complexity can be eliminated by permitting the temperature of the self-assembly system to be adjusted throughout the assembly...
Ming-Yang Kao, Robert T. Schweller
ENDM
2006
70views more  ENDM 2006»
15 years 1 months ago
Quasirandomness in Graphs
Jim Propp's rotor router model is a simple deterministic analogue of a random walk. Instead of distributing chips randomly, it serves the neighbors in a fixed order. We analy...
Benjamin Doerr, Tobias Friedrich
109
Voted
COMGEO
2007
ACM
15 years 1 months ago
Learning smooth shapes by probing
We consider the problem of discovering a smooth unknown surface S bounding an object O in R3 . The discovery process consists of moving a point probing device in the free space ar...
Jean-Daniel Boissonnat, Leonidas J. Guibas, Steve ...
JGT
2008
83views more  JGT 2008»
15 years 1 months ago
Monochromatic Hamiltonian t-tight Berge-cycles in hypergraphs
Abstract: In any r-uniform hypergraph H for 2 t r we define an runiform t-tight Berge-cycle of length , denoted by C(r,t) , as a sequence of distinct vertices v1, v2, . . . , v ,...
Paul Dorbec, Sylvain Gravier, Gábor N. S&aa...
EOR
2007
82views more  EOR 2007»
15 years 1 months ago
Minimizing makespan with multiple-orders-per-job in a two-machine flowshop
: New semiconductor wafer fabrication facilities use Front Opening Unified Pods (FOUPs) as a common unit of wafer transfer. Since the number of pods is limited due to high costs, a...
Jeffrey D. Laub, John W. Fowler, Ahmet B. Keha