Results 31 to 40 of about 36,156 (153)
PGGA: A predictable and grouped genetic algorithm for job scheduling [PDF]
, 2006 This paper presents a predictable and grouped genetic algorithm (PGGA) for job scheduling. The novelty of the PGGA is twofold: (1) a job workload estimation algorithm is designed to estimate a job workload based on its historical execution records, (2 ...
Li, M, Qi, M, Yu, B
core
Hewitt-Marczewski-Pondiczery type theorem for abelian groups and Markov's potential density
, 2009 For an uncountable cardinal \tau and a subset S of an abelian group G, the following conditions are equivalent: (i) |{ns:s\in S}|\ge \tau for all integers n\ge 1; (ii) there exists a group homomorphism \pi:G\to T^{2^\tau} such that \pi(S) is dense in T ...
Dikranjan, Dikran, Shakhmatov, Dmitri
core +1 more source
PERANCANGAN DAN PENGEMBANGAN MESIN PENGAHANCUR SAMPAH ORGANIK MODEL PISAU PUTAR (ROTARY)
Rotor: Jurnal Ilmiah Teknik Mesin, 2012 This design to make the organic garbage crusher machine which its structure can be made easy and cheap by society, and can be operated simply, moved by diesel engine 20 hp own the ability can can break the permanent organic garbage upon which compost ...
Yuni Hermawan +2 more
doaj
AMS Subject Classification: 05B05, 05E30, 05C50.Strongly regular graph;Group divisible design;Deza graph;(v;k ...
Haemers, W.H. +2 more
core +1 more source
Constructions of biangular tight frames and their relationships with equiangular tight frames
, 2017 We study several interesting examples of Biangular Tight Frames (BTFs) - basis-like sets of unit vectors admitting exactly two distinct frame angles (ie, pairwise absolute inner products) - and examine their relationships with Equiangular Tight Frames ...
Cahill, Jameson +3 more
core +1 more source
Combinatorial aspects of covering arrays
Le Matematiche, 2004 Covering arrays generalize orthogonal arrays by requiring that t -tuples be covered, but not requiring that the appearance of t -tuples be balanced.Their uses in screening experiments has found application in software testing, hardware testing, and a ...
Charles J. Colbourn
doaj
DeMAID: A Design Manager's Aide for Intelligent Decomposition user's guide [PDF]
A design problem is viewed as a complex system divisible into modules. Before the design of a complex system can begin, the couplings among modules and the presence of iterative loops is determined.
Rogers, James L.
core +1 more source
An intelligent advisor for the design manager [PDF]
A design problem is viewed as a complex system divisible into modules. Before the design of a complex system can begin, much time and money are spent in determining the couplings among modules and the presence of iterative loops.
Padula, Sharon L., Rogers, James L.
core +1 more source
, 2020 Bu tez Gruplara Bü lunebilen Tasarımlar (GDD'ler) uzerinedir. GDD'ler Kombina-oü ütoryel Tasarımlar Teorisindeki ana yapılardan birisidir. GDD'ler ilk defa 1975'deHanani tarafından tanımlanmıs ve o gunden bu yana mesala PBD, Frame ve BIBDş ügibi kombinatoryel yapıların insaasında sıkca kullanılmıstır.ş ş şBir GDD (X, G, B) uclusu ...
openaire +1 more source
t-Divisible designs from imprimitive permutation groups
European Journal of Combinatorics, 1992 A \(t\)-divisible design \((t\)-DD) is known as a group divisible design if \(t=2\) and the size of a point class exceeds 1, and a \(t\)-DD is simply a \(t\)-design if a point class is of size 1. The author constructs \(t\)-DD's by means of \(R\)-permutation groups \((G,X,R)\), where \(R\) is an equivalence relation on the set \(X\) and \(G\) is an \(R\
openaire +1 more source