Sciweavers

5269 search results - page 92 / 1054
» order 2007
Sort
View
118
Voted
AMC
2007
89views more  AMC 2007»
15 years 4 months ago
Iterative methods for computing generalized inverses
We develop several iterative methods for computing generalized inverses using both first and second order optimization methods in C∗ -algebras. Known steepest descent iterative...
Dragan S. Djordjevic
141
Voted
DAGSTUHL
2006
15 years 5 months ago
The complexity of Boolean functions from cryptographic viewpoint
Cryptographic Boolean functions must be complex to satisfy Shannon's principle of confusion. But the cryptographic viewpoint on complexity is not the same as in circuit compl...
Claude Carlet
EOR
2007
82views more  EOR 2007»
15 years 3 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
JCT
2007
83views more  JCT 2007»
15 years 3 months ago
On 6-sparse Steiner triple systems
We give the first known examples of 6-sparse Steiner triple systems by constructing 29 such systems in the residue class 7 modulo 12, with orders ranging from 139 to 4447. We the...
A. D. Forbes, Mike J. Grannell, Terry S. Griggs
ARSCOM
2004
86views more  ARSCOM 2004»
15 years 3 months ago
New Conditions for k-ordered Hamiltonian Graphs
We show that in any graph G on n vertices with d(x) + d(y) n for any two nonadjacent vertices x and y, we can fix the order of k vertices on a given cycle and find a hamiltonian c...
Guantao Chen, Ronald J. Gould, Florian Pfender