ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

X
feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
Filter
  • Shortest-paths  (1)
  • cadmium selenide  (1)
  • Springer  (2)
  • American Chemical Society (ACS)
  • 1
    Electronic Resource
    Electronic Resource
    Approaches for Generating Mesoscale Patterns of Semiconductor Nanoclusters (1997)
    Springer
    Journal of cluster science 8 (1997), S. 159-178 
    Details
    ISSN: 1572-8862
    Keywords: Mesoscale patterns ; cadmium selenide
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mechanical Engineering, Materials Science, Production Engineering, Mining and Metallurgy, Traffic Engineering, Precision Mechanics , Physics
    Notes: Abstract In this review, existing approaches for the manipulation and/or construction of isolated semiconductor nanoclusters into deliberate, patterned arrays are described. Diverse examples of different strategies from solid state, solution, and hybrid combinations are described as well as successes achieved to date. The approaches to be discussed include conventional solid state lithography, volumetric constriction of monodisperse nanoclusters deposited from solution, and the use of anchored macromolecular templates to direct semiconductor nanocluster assembly.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1023/A:1022679923799
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 2
    Electronic Resource
    Electronic Resource
    The one-to-one shortest-path problem: An empirical analysis with the two-tree Dijkstra algorithm (1993)
    Springer
    Computational optimization and applications 2 (1993), S. 47-75 
    Details
    ISSN: 1573-2894
    Keywords: Shortest-paths ; parallel algorithms
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract Four new shortest-path algorithms, two sequential and two parallel, for the source-to-sink shortest-path problem are presented and empirically compared with five algorithms previously discussed in the literature. The new algorithm, S22, combines the highly effective data structure of the S2 algorithm of Dial et al., with the idea of simultaneously building shortest-path trees from both source and sink nodes, and was found to be the fastest sequential shortest-path algorithm. The new parallel algorithm, PS22, is based on S22 and is the best of the parallel algorithms. We also present results for three new S22-type shortest-path heuristics. These heuristics find very good (often optimal) paths much faster than the best shortest-path algorithm.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01299142
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...