نتایج جستجو برای: greediness

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

Journal: : 2022

Fortna- a historian of the Modern Middle East with research focuses on late Ottoman Empire and early Turkish Republic- begins his work showing importance education in modern world. However, its role is only comprehended to certain degree little consideration given educational concepts. Fortna explains main purpose writing this book as analyzing general acceptances relationship moder- nity. The ...

Journal: :Humanities & social sciences communications 2021

Abstract The purpose of this study is three fold; first, it attempts to show what extent Fielding’s writings unfold the basic characteristics eighteenth century lines thinking, foremost which importance context for determination meaning. Second, philosophy human nature which, according him, a mixture man’s selfishness, greediness, honesty and charity, all are ‘characters’ nature. Third, present...

2016
Giuseppe Facchetti

A way to decipher the complexity of the cellular metabolism is to study the effect of different external perturbations. Through an analysis over a sufficiently large set of gene knockouts and growing conditions, one aims to find a unifying principle that governs the metabolic regulation. For instance, it is known that the cessation of the microorganism proliferation after a gene deletion is onl...

2007
Toshiyuki Sueyoshi Gopalakrishna Reddy Tadiparthi

During the summer (2000), wholesale electricity prices in California were approximately 500% higher than those during the same months in 1998-1999. The price hike was unexpected by many policy makers and individuals who were involved in the electric utility industry. They have been long wondering whether the electricity deregulation policy (1996) produced benefits of competition promised to con...

1995
A. E. Eiben Paul-Erik Raué Zsófia Ruttkay

In this paper we discuss the possibilities of applying genetic algorithms (GA) for solving constraint satisfaction problems (CSP). We point out how the greediness of deterministic classical CSP solving techniques can be counterbalanced by the random mechanisms of GAs. We tested our ideas by running experiments on four diierent CSPs: N-queens, graph 3-colouring, the traac lights and the Zebra pr...

Journal: :Physical review letters 2012
Sang Hoon Lee Petter Holme

During the last decade of network research focusing on structural and dynamical properties of networks, the role of network users has been more or less underestimated from the bird's-eye view of global perspective. In this era of global positioning system equipped smartphones, however, a user's ability to access local geometric information and find efficient pathways on networks plays a crucial...

Journal: :Bio-medical materials and engineering 2015
Muhammad Sajjad Irfan Mehmood Sung Wook Baik

Image super-resolution (SR) plays a vital role in medical imaging that allows a more efficient and effective diagnosis process. Usually, diagnosing is difficult and inaccurate from low-resolution (LR) and noisy images. Resolution enhancement through conventional interpolation methods strongly affects the precision of consequent processing steps, such as segmentation and registration. Therefore,...

2007
Yuli Ye Allan Borodin

Greedy algorithms are simple, but their relative power is not well understood. The priority framework (Borodin et al. in Algorithmica 37:295–326, 2003) captures a key notion of “greediness” in the sense that it processes (in some locally optimal manner) one data item at a time, depending on and only on the current knowledge of the input. This algorithmic model provides a tool to assess the comp...

1998
Edward A. HIRSCH

HARD FORMULAS FOR SAT LOCAL SEARCH ALGORITHMS Edward A. HIRSCH Russian Academy of Sciences Steklov Mathematical Institute St. Petersburg Department 27 Fontanka, St. Petersburg, 191011, Russia E-mail: [email protected] September 6, 1998 Abstract In 1992 B. Selman, H. Levesque and D. Mitchell proposed GSAT, a greedy local search algorithm for the Boolean satis ability problem. Good performance o...

2010
Peter Nilsson Pierre Nugues

This paper describes a search procedure to discover optimal feature sets for dependency parsers. The search applies to the shift–reduce algorithm and the feature sets are extracted from the parser configuration. The initial feature is limited to the first word in the input queue. Then, the procedure uses a set of rules founded on the assumption that topological neighbors of significant features...

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

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