نتایج جستجو برای: balanced cost

تعداد نتایج: 430917  

2007
K. Vernard Harrington Tracy L. Lewis Wanda J. Smith France Belanger

In this qualitative study, undergraduate computing students from two mid-sized southeastern universities participated in focus groups to explore their (1) developing professional identities, (2) salient stressors within their computing education programs, and (3) coping strategies used to navigate these stressors. Students provided contextual evidence to support the formation of professional id...

2011
Enrique Herrera-Viedma Francisco Javier Cabrerizo Ignacio J. Pérez Manolo J. Cobo Sergio Alonso Francisco Herrera

In Group Decision Making (GDM) the automatic consensus models are guided by different consensus measures which usually are obtained by aggregating similarities observed among experts’ opinions. Most GDM problems based on linguistic approaches use symmetrically and uniformly distributed linguistic term sets to express experts’ opinions. However, there exist problems whose assessments need to be ...

Journal: :Appl. Math. Lett. 2002
Rafael Bru Carmen Coll Néstor Thome

using the group inverse, an explicit solution to a symmetric singular system is described. The general explicit solution is derived when the symmetric singular system satisfies the regularity condition. Certain special properties of these singular systems are presented. Finally, a symmetric balanced realization is obtained from an equivalent standard control system. @ 2002 Elsevier Science Ltd....

2010
Guy E. Blelloch Jeremy T. Fineman Phillip B. Gibbons Harsha Vardhan Simhadri

This paper presents a scheduling algorithm for efficiently implementing nested-parallel computations on parallel memory hierarchies (trees of caches). To capture the cache cost of nested-parallel computations we introduce a parallel version of the ideal cache model. In the model algorithms can be written cache obliviously (no choices are made based on machine parameters) and analyzed using a si...

Journal: :Algorithms 2022

This paper presents a new heuristic algorithm tailored to solve large instances of an NP-hard variant the shortest path problem, denoted cost-balanced recently proposed in literature. The problem consists finding origin–destination direct graph, having both negative and positive weights associated with arcs, such that total sum selected arcs is as close zero possible. At least authors’ knowledg...

Journal: :Journal of Agriculture, Food Systems, and Community Development 2014

2013
Xiao-hong Chen Yu Cao

Based on unbalanced panel dates of 4060 companies listed from 2003 2007 in Shanghai and Shenzhen Stock Markets, this paper empirically studies the degree of product market competition, the relationship between cash dividends distribution tendency and cash dividends policy. Results show that controlling shareholders have significant motivation to distribute cash dividends, and this kind of incen...

2010
Xiao-Wu Chen

Article history: Received 9 April 2009 Available online 17 September 2010 Communicated by Luchezar L. Avramov Dedicated to Professor Claus Michael Ringel on the occasion of his sixty-fifth birthday MSC: 18G25 18E30 16E65

Journal: :Electr. J. Comb. 2008
Marcelo H. de Carvalho Charles H. C. Little

We introduce the concept of combed graphs and present an ear decomposition theorem for this class of graphs. This theorem includes the well known ear decomposition theorem for matching covered graphs proved by Lovász and Plummer. Then we use the ear decomposition theorem to show that any two edges of a 2-connected combed graph lie in a balanced circuit of an equivalent combed graph. This result...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید