UB Paderborn / Katalog / Suche / in CDI

Sortiert nach

Einfacher Volltextzugriff von (fast) überall

Installieren Sie die LibKey Nomad-Browsererweiterung und erhalten Sie von vielen Webseiten einfachen Zugriff auf lizenzierte Volltexte oder Open Access Publikationen. Mehr erfahren...

An analysis of collaborative problem‐solving activities mediated by individual‐based and collaborative computer simulations

Journal of computer assisted learning, 2017-12, Vol.33 (6), p.649-662

2017

Volltextzugriff (PDF)

A survey on multi-loop networks

Theoretical computer science, 2003-04, Vol.299 (1-3), p.107-121

Hwang, F.K.

2003

Volltextzugriff (PDF)

A content-based image retrieval system based on object-moment feature

The imaging science journal, 2014-11, Vol.62 (8), p.415-422

2014

Volltextzugriff (PDF)

A complementary survey on double-loop networks

Theoretical computer science, 2001, Vol.263 (1), p.211-229

Hwang, F.K.

2001

Volltextzugriff (PDF)

A unifying approach to determine the necessary and sufficient conditions for nonblocking multicast 3-stage Clos networks

IEEE transactions on communications, 2005-09, Vol.53 (9), p.1581-1586

Hwang, F.K.

2005

Volltextzugriff (PDF)

Steiner tree problems

Networks, 1992-01, Vol.22 (1), p.55-89

1992

Volltextzugriff (PDF)

A hierarchy of importance indices

IEEE transactions on reliability, 2005-03, Vol.54 (1), p.169-172

Hwang, F.K.

2005

Volltextzugriff (PDF)

Wide-sense nonblocking for symmetric or asymmetric 3-stage Clos networks under various routing strategies

Theoretical computer science, 2004-04, Vol.314 (3), p.375-386

2004

Volltextzugriff (PDF)

An unexpected meeting of four seemingly unrelated problems : graph testing, DNA complex screening, superimposed codes and secure key distribution

Journal of combinatorial optimization, 2007-10, Vol.14 (2-3), p.121-129

2007

Volltextzugriff (PDF)

Error-tolerant pooling designs with inhibitors

Journal of computational biology, 2003-01, Vol.10 (2), p.231-236

2003

Volltextzugriff (PDF)

An almost-linear time and linear space algorithm for the longest common subsequence problem

Information processing letters, 2005-05, Vol.94 (3), p.131-135

2005

Volltextzugriff (PDF)

On Macula's error-correcting pool designs

Discrete mathematics, 2003-07, Vol.268 (1), p.311-314

Hwang, F.K.

2003

Volltextzugriff (PDF)

Supermodularity in Mean-Partition Problems

Journal of global optimization, 2005-11, Vol.33 (3), p.337-347

2005

Volltextzugriff (PDF)

The optimal consecutive-k-out-of-n:G line for n ≤ 2k

Journal of statistical planning and inference, 2005-01, Vol.128 (1), p.281-287

2005

Volltextzugriff (PDF)

The minimum distance diagram of double-loop networks

IEEE transactions on computers, 2000-09, Vol.49 (9), p.977-979

2000

Volltextzugriff (PDF)

Tessellating polyominos in the plane

Discrete mathematics, 2006-06, Vol.306 (12), p.1139-1144

2006

Volltextzugriff (PDF)

Some permutation routing algorithms for low-dimensional hypercubes

Theoretical computer science, 2002-01, Vol.270 (1), p.111-124

2002

Volltextzugriff (PDF)

Strict nonblockingness of reduced shuffle-exchange networks

Networks, 2005-01, Vol.45 (1), p.4-8

2005

Volltextzugriff (PDF)

New construction for transversal design

Journal of computational biology, 2006-05, Vol.13 (4), p.990-995

2006

Volltextzugriff (PDF)

A modification to a decomposition algorithm of Gordon and Srikanthan

IEEE transactions on computers, 1997-08, Vol.46 (8), p.958-960

Hwang, F.K.

1997

Volltextzugriff (PDF)

A novel use of t-packings to construct d-disjunct matrices

Discrete Applied Mathematics, 2006-07, Vol.154 (12), p.1759-1762

2006

Volltextzugriff (PDF)

Sequential construction of a circular consecutive-2 system

Information processing letters, 2000-10, Vol.75 (5), p.231-235

2000

Volltextzugriff (PDF)

Random pooling designs under various structures

Journal of combinatorial optimization, 2003-12, Vol.7 (4), p.339-352

2003

Volltextzugriff (PDF)

Wide-sense nonblocking for multirate 3-stage Clos networks

Theoretical computer science, 1997-08, Vol.182 (1), p.171-182

1997

Volltextzugriff (PDF)

A GENERAL APPROACH TO COMPUTE THE PROBABILITIES OF UNRESOLVED CLONES IN RANDOM POOLING DESIGNS

Probability in the engineering and informational sciences, 2004-04, Vol.18 (2), p.161-183

2004

Volltextzugriff (PDF)

1 – 25 von 2.977

Menü

Weitere Dienste

Einstellungen

An analysis of collaborative problem‐solving activities mediated by individual‐based and collaborative computer simulations

A survey on multi-loop networks

A content-based image retrieval system based on object-moment feature

A complementary survey on double-loop networks

A unifying approach to determine the necessary and sufficient conditions for nonblocking multicast 3-stage Clos networks

Steiner tree problems

A hierarchy of importance indices

Wide-sense nonblocking for symmetric or asymmetric 3-stage Clos networks under various routing strategies

An unexpected meeting of four seemingly unrelated problems : graph testing, DNA complex screening, superimposed codes and secure key distribution

Error-tolerant pooling designs with inhibitors

An almost-linear time and linear space algorithm for the longest common subsequence problem

On Macula's error-correcting pool designs

Supermodularity in Mean-Partition Problems

The optimal consecutive-k-out-of-n:G line for n ≤ 2k

The minimum distance diagram of double-loop networks

Tessellating polyominos in the plane

Some permutation routing algorithms for low-dimensional hypercubes

Strict nonblockingness of reduced shuffle-exchange networks

New construction for transversal design

A modification to a decomposition algorithm of Gordon and Srikanthan

A novel use of t-packings to construct d-disjunct matrices

Sequential construction of a circular consecutive-2 system

Random pooling designs under various structures

Wide-sense nonblocking for multirate 3-stage Clos networks

A GENERAL APPROACH TO COMPUTE THE PROBABILITIES OF UNRESOLVED CLONES IN RANDOM POOLING DESIGNS

Suchergebnisse filtern