نتایج جستجو برای: sd heuristics method

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

Journal: :Doksa 2023

The study surveys the conceptions of philosophical heuristics J. Baggini and P. S. Fosl, D. Dennett, A. Hájek, R. Nozick. All surveyed in are instrumental. Nozick’s Hájek’s ought to be considered “authentic” because Nozick Hájek called them “the heuristics.” Those aim solve (philosophical) problems rooted Decision theory. Dennett’s “philosophical heuristics” according H?jek’s classification is ...

2009
Edmund K. Burke Rong Qu Amr Soghier

In this paper, we describe the development of a Greedy Random Adaptive Search Procedure (GRASP) where two low-level graph heuristics, Saturation Degree (SD) and Largest Weighted Degree (LWD) are dynamically hybridised in the construction phase to construct solutions for exam timetabling problems. The problem is initially solved using an intelligent adaptive LWD and SD graph hyper-heuristic whic...

2010
Vincent Boyer Didier El Baz Moussa Elkihel

Abstract: This article presents an exact cooperative method for the solution of the multidimensional knapsack problem ( ) MKP which combines dynamic programming and branch and bound. Our method makes cooperate a dynamic programming heuristics based on surrogate relaxation and a branch and bound procedure. Our algorithm was tested for several randomly generated test sets and problems in the lite...

2012
Franco Bagnoli Emanuele Massaro Andrea Guazzini

We explore a community-detection cellular automata algorithm inspired by human heuristics, based on information diffusion and a non-linear processing phase with a dynamics inspired by human heuristics. The main point of the methods is that of furnishing different “views” of the clustering levels from an individual point of view. We apply the method to networks with local connectivity and long-r...

Journal: :International Journal on Interactive Design and Manufacturing (IJIDeM) 2014

Journal: :She Ji: The Journal of Design, Economics, and Innovation 2019

2008
V. BOYER Didier EL BAZ Moussa ELKIHEL

This article presents an exact cooperative method for the solution of the Multidimensional Knapsack Problem (MKP ) which combines dynamic programming and branch and bound. Our method makes cooperate a dynamic programming heuristics based on surrogate relaxation and a branch and bound procedure. Our algorithm was tested for several randomly generated test sets and problems in the literature. Sol...

Journal: :European Journal of Operational Research 2020

Journal: :Artificial Intelligence 2012

Journal: :The Annual review of sociology 1995

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

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