Results 261 to 270 of about 1,002,043 (319)
Some of the next articles are maybe not open access.

Related searches:

Learning practically feasible policies for online 3D bin packing

Science China Information Sciences, 2021
We tackle the online 3D bin packing problem (3D-BPP), a challenging yet practically useful variant of the classical bin packing problem. In this problem, the items are delivered to the agent without informing the full sequence information. The agent must
Hang Zhao   +4 more
semanticscholar   +1 more source

Molecular Packing: Another Key Point for the Performance of Organic and Polymeric Optoelectronic Materials.

Accounts of Chemical Research, 2020
ConspectusOptoelectronic material properties are governed by the whole collective of organic moieties, and these aggregate states present the characteristic performance of extended assemblies with different molecular packing, not only of single molecules
Qianqian Li, Zhen Li
semanticscholar   +1 more source

ACQ-to-AIE Transformation: Tuning Molecular Packing by Regioisomerization for Two-photon NIR Bioimaging.

Angewandte Chemie, 2020
The traditional molecule's strategic designs for highly bright solid-state luminescent materials rely on weakening the intermolecular π-π interactions, which may limit diversity when developing new materials.
Yuanyuan Li   +12 more
semanticscholar   +1 more source

Packing Arrays and Packing Designs

Designs, Codes and Cryptography, 2002
For parameters for which orthogonal arrays do not exist, one may study related packing arrays. A packing array is a \(k \times b\) array with \(q\)-ary entries and with the property that in every \(t \times b\) subarray, every \(t \times 1\) column vector appears at most once. One usually wants to maximize \(b\) for given parameters.
Stevens, Brett, Mendelsohn, Eric
openaire   +2 more sources

DENSE PACKING

International Journal of Modern Physics B, 2004
Phyllotaxis of plant organs, bacterial ordering and animal coat patterns are analyzed for homogeneity and density. The patterns are approximated by 15 tiles and characterized by the self-coordination numbers T1, T2, T3 of the nearest, next-nearest and third neighbors of the vertices of the tiles.
Hauck, J., Mika, K.
openaire   +2 more sources

Home - About - Disclaimer - Privacy