Results 311 to 320 of about 734,348 (361)
Some of the next articles are maybe not open access.

The Tree Model for Hashing: Lower and Upper Bounds

SIAM Journal on Computing, 1996
Summary: We define a new simple and general model for hashing. The basic model together with several variants capture many natural (sequential and parallel) hashing algorithms and represent common hashing practice. Our main results exhibit tight tradeoffs between hash-table size and the number of applications of a hash function on a single key.
Gil, Joseph   +2 more
openaire   +2 more sources

Lower bounds and upper bounds for chromatic polynomials

Journal of Graph Theory, 1993
AbstractIn this paper we give lower bounds and upper bounds for chromatic polynomials of simple undirected graphs on n vertices having m edges and girth exceeding g © 1993 John Wiley & Sons, Inc.
openaire   +2 more sources

Lower und Upper Bounds

2004
Mit Hilfe von Lower und Upper Bounds, die in der deutschsprachigen Literatur auch als untere und obere Schranken bezeichnet werden,1last sich der Wertebereich des (unbekannten) optimalen Zielwerts einer Probleminstanz einschranken. Dabei bestimmen Lower bzw. Upper Bounds Werte, die nicht groser bzw.
openaire   +1 more source

A new approach to distributed control for multi-agent systems based on approximate upper and lower bounds

International Journal of Control, Automation and Systems, 2017
Fangfang Zhang   +4 more
semanticscholar   +1 more source

Improved Upper and Lower Bounds for the Close Enough Traveling Salesman Problem

Grid and Pervasive Computing, 2017
F. Carrabs   +3 more
semanticscholar   +1 more source

Upper and Lower Bounds for Controllable Subspaces of Networks of Diffusively Coupled Agents

IEEE Transactions on Automatic Control, 2014
Shuo Zhang, M. Cao, M. Camlibel
semanticscholar   +1 more source

SARS-CoV-2 pathogenesis

Nature Reviews Microbiology, 2022
Mart M Lamers, Bart L Haagmans
exaly  

Home - About - Disclaimer - Privacy