Results 81 to 90 of about 306,960 (218)
Agroforestry systems are indicated as an alternative for sugarcane (Saccharum officinarum) cultivation in Piracicaba, SP, Brazil, however there are not many field experiments on plant performance under these conditions in the world. The objective of this
Luís Fernando Guedes Pinto +2 more
doaj +1 more source
Polyhedral Computations for the Simple Graph Partitioning Problem [PDF]
The simple graph partitioning problem is to partition an edge-weighted graph into mutually disjoint subgraphs, each containing no more than b nodes, such that the sum of the weights of all edges in the subgraphs is maximal.
Sørensen, Michael M.
core
Responses of Young Tea (Camellia Sinensis) Clones to Drought and Temperature II: Dry Matter Production and Partitioning [PDF]
The physiological basis for differences in yields from well-watered and droughted plants of four contrasting clones of tea were studied in terms of light interception, dry matter production and partitioning at a high altitude site in Southern Tanzania
Carr, M. K. V., Burgess, Paul J.
core +1 more source
This work aimed to study the partitioning of a lipase produced by Burkholderia cepacia in PEG/Phosphate aqueous two phase system (ATPS) and its characterization. Lipase was produced by B. cepacia strains in a fermenter. Enzyme partitioning occurred at pH
Giovana da Silva Padilha +3 more
doaj +1 more source
Élaboration d'une nouvelle métaheuristique pour le partitionnement de graphe : la méthode de fusion-fission. Application au découpage de l'espace aérien [PDF]
Dans cette thèse, nous étudions des méthodes de partitionnement de graphe et les appliquons au découpage de l'espace aérien, ainsi qu'à d'autres problèmes. L'espace aérien est composé de volumes limités, appelés secteurs de contrôle, chacun étant sous la
Bichot, Charles-Edmond
core
On Base Partitions and Cover Partitions of Skew Characters [PDF]
In this paper we give an easy combinatorial description for the base partition ${\cal B}$ of a skew character $[{\cal A}]$, which is the intersection of all partitions $\alpha$ whose corresponding character $[\alpha]$ appears in $[{\cal A}]$. This we use to construct the cover partition ${\cal C}$ for the ordinary outer product as well as for the ...
openaire +4 more sources
Certain amount of retained austenite can increase ductility of steels because of the TRIP phenomenon during plastic deformation. One method for achieving this is partitioning of carbon into austenite to stabilize it at room temperature. The quenching and
A. Shirali +2 more
doaj
Simple K-Medoids Partitioning Algorithm for Mixed Variable Data
A simple and fast k-medoids algorithm that updates medoids by minimizing the total distance within clusters has been developed. Although it is simple and fast, as its name suggests, it nonetheless has neglected local optima and empty clusters that may ...
Weksi Budiaji, Friedrich Leisch
doaj +1 more source
An extension of set partitioning with application to scheduling problems
The well known problems of set covering, set partitioning and set packing are defined and their interrelationship is considered. A natural generalisation called the extended set partitioning model is presented and the three standard models are shown to ...
Mitra, G, Darby-Dowman, K
core
k-Partitioning problems with partition matroid constraint
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Biao Wu, Enyue Yao
openaire +2 more sources

