In the minimum signed (minus) total domination problem for a graph G = (V, E), it is required to find a function f : V → {-1, 1} ({-1, 0, 1}) such that f(NG(v)) = ∑u∈NG(v)f(u) ≥ 1 for each v ∈ V, and the cost f(V) = ∑v∈Vf(v) is minimized. We...
A Complexity Function in computer science is defined as a function that calculates the sum of the number of generated rules and the number of metamodel elements in each rule, with the aim to minimize it. AI generated definition based on: Advances in Computers, 2014 ...
Cellular proteins CPSF6, NUP153 and SEC24C play crucial roles in HIV-1 infection. While weak interactions of short phenylalanine-glycine (FG) containing peptides with isolated capsid hexamers have been characterized, how these cellular factors functionally engage with biologically relevant mature HIV-1...
We, in this paper, precisely study this problem for commonly used tournament solutions: given an oracle access to the edges of a tournament T, find $f(T)$ by querying as few edges as possible, for a tournament solution f. We first show that the set of Condorcet non-losers in a ...
The first chapter is devoted to RM in airline pa... BCS Pun - Northwestern University. 被引量: 0发表: 2013年 Choice network revenue management based on new compact formulations The choice network revenue management model incorporates customer purchase probabilities as a function of the offered ...
find that urban mobility readiness and its negation are not determined by singular conditions but by a combination of conditions. Necessary conditions such as infrastructure and socioeconomic factors have been identified, which are critical for achieving a higher level of readiness in the UMR, and ...
V.M. Khrapchenko, Complexity of the realization of a linear function in the class of π-circuits, Math. Notes Acad. Sciences USSR9 (1971), 21 – 23. CrossRef B. M. Xрапченко. Ободномметодеполучениянижнихоценоксложност...
Themodel complexityrefers to the complexity of the function attempted to be learned –similar to apolynomial degree. The nature of thetraining datagenerally determines the proper level of model complexity. If a small amount of data or whole data is not uniformly spread throughout different possible...
We find new sample complexity bounds for real function learning tasks in the uniformdistribution by means of linear neural networks. These bounds, tighter than thedistribution-free ones reported elsewhere in the literature, are applicabl... A Hernández-Aguirre,C Koutsougeras,B Buckles - 《Internat...
The results show that while the number of objective function evaluations needed to find a solution is often increased by using m<n the increase in computational efficiency leads to a lower overall run time. 展开 关键词: complexity covariance matrix adaptation evolution strategy ...