نتایج جستجو برای: competitive strategies

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

2015
Eric Berger Anne Duncan Jim Gibson Megan McCracken

When people learn that I study lethal injection, they are usually curious to know more (or at least they are polite enough to ask questions). Interestingly, the question that arises most often— from lawyers, law students, and laypeople—is why states behave as they do. In the wake of botched executions and ample evidence of lethal injection‘s dangers, why do states fail to address their executio...

2007
Paolo Turrini John-Jules Ch. Meyer Cristiano Castelfranchi

A student, supported by his classmates, throws a piece of chalk at the teacher who is writing on the blackboard. The teacher rapidly turns back and promptly catches him in the act. The student blushes and suddenly realizes how bad it was what he did. What happened to the guy? Why did he decide to throw the piece of chalk? And why, after a few seconds, he would have liked that what he did had ne...

Journal: :مدیریت بازرگانی 0
حسین صفری دانشیار گروه مدیریت، دانشکدۀ مدیریت دانشگاه تهران، تهران، ایران میر محمود سادات کارشناس‎ارشد مدیریت صنعتی ـ تحقیق در عملیات، دانشکدۀ مدیریت، دانشگاه تهران، تهران، ایران علی اصغر سعدآبادی دانشجوی دکتری. دانشکده علوم و فنون نوین، دانشگاه تهران، تهران، ایران

abstract today, competitive strategies have got accepted as one of the most important means of manager to compete in markets. in the strategic management process, development of the strategic quantitative objectives based merely on the experts’ ideas.in this research, after reviewing the bsc,swot, judo strategy model and blue ocean strategy model, the concepts are applied to increase quality of...

1995
Nian Gu

The subject of this thesis is to study the problem of dynamic processor allocation in parallel application scheduling. Processor allocation involves determining the number of processors to allocate to each of several simultaneously executing parallel applications and possibly dynamically adjusting the allocations during execution to improve overall system performance. We devise and analytically...

1998
Robert E. Marks David F. Midgley

Genetic algorithms (GAs) have been used extensively in engineering and computer science to optimize specific functions, especially those which exhibit non-convexities and so are not amenable to calculus-based methods of optimization. A parallel use of GAs has been to solve algorithmic problems. A third domain in which GAs have been used is that of searching for mappings which optimize a repeate...

Journal: :J. Electron. Commerce Res. 2001
Namchul Shin

Despite rapid and sustained development of electronic commerce, many companies doing e-business are still in the investment and brand-building phase and have yet to show a profit. However, as e-businesses shift their focus from building a customer base to increasing revenue growth and profitability, they should re-evaluate their current business strategies, if any, and develop strategies that p...

Journal: :IJTD 2014
Shameem Akhter Nayem Rahman Mohammad Nirjhar Rahman

A firm’s competitive behavior is very important for its survival. Relevant stakeholders in an industry are interested in a firm’s operational as well as financial performance. In order to gain competitive advantage, a firm must remain steadfast during changes it goes through over time. This is true for the computer industry as well. The computer industry has been advancing very fast and firms i...

2006
Vladimir Vovk

We start from a simple asymptotic result for the problem of online regression with the quadratic loss function: the class of continuous limited-memory prediction strategies admits a “leading prediction strategy”, which not only asymptotically performs at least as well as any continuous limited-memory strategy but also satisfies the property that the excess loss of any continuous limited-memory ...

2015
Marek Chrobak Christoph Dürr Bengt J. Nilsson

A clique clustering of a graph is a partitioning of its vertices into disjoint cliques. The quality of a clique clustering is measured by the total number of edges in its cliques. We consider the online variant of the clique clustering problem, where the vertices of the input graph arrive one at a time. At each step, the newly arrived vertex forms a singleton clique, and the algorithm can merge...

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

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