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

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

2010
Salles V. G. Magalhães Marcus Vinícius Alvim Andrade Chaulio Ferreira

This work deals with the observer siting problem in terrains represented by digital elevation matrices. This problem consists in minimize the number of observers needed to see (or cover) a given percentage of a terrain. Two heuristics are proposed to solve this problem and these heuristics are compared with a method described in literature. Tests show that the proposed heuristics generate solut...

2009
Riccardo Poli Mario Graff

In this paper we prove that in some practical situations, there is a free lunch for hyper-heuristics, i.e., for search algorithms that search the space of solvers, searchers, meta-heuristics and heuristics for problems. This has consequences for the use of genetic programming as a method to discover new search algorithms and, more generally, problem solvers. Furthermore, it has also rather impo...

2014
David Tolpin Oded Betzalel Ariel Felner Solomon Eyal Shimony

Recent advances in metareasoning for search has shown its usefulness in improving numerous search algorithms. This paper applies rational metareasoning to IDA* when several admissible heuristics are available. The obvious basic approach of taking the maximum of the heuristics is improved upon by lazy evaluation of the heuristics, resulting in a variant known as Lazy IDA*. We introduce a rationa...

2013
I. A. Güney Gürhan Küçük Ender Özcan

In Simultaneous Multi-Threaded (SMT) processor datapaths, there are many datapath resources that are shared by multiple threads. Currently, there are a few heuristics that distribute these resources among threads for better performance. A selection hyper-heuristic is a search method which mixes a fixed set of heuristics to exploit their strengths while solving a given problem. In this study, we...

Flexible flow shop scheduling problem (FFS) with unrelated parallel machines contains sequencing in flow shop where, at any stage, there exists one or more processors. The objective consists of minimizing the maximum completion time. Because of NP-completeness of FFS problem, it is necessary to use heuristics method to address problems of moderate to large scale problem. Therefore, for assessme...

Journal: :International journal of medical informatics 2010
Jeungok Choi Suzanne Bakken

PURPOSE Low health literacy has been associated with poor health-related outcomes. The purposes are to report the development of a website for low-literate parents in the Neonatal Intensive Care Unit (NICU), and the findings of heuristic evaluation and a usability testing of this website. METHODS To address low literacy of NICU parents, multimedia educational Website using visual aids (e.g., ...

2011
D. Chris Rayner Michael H. Bowling Nathan R. Sturtevant

We pose the problem of constructing good search heuristics as an optimization problem: minimizing the loss between the true distances and the heuristic estimates subject to admissibility and consistency constraints. For a well-motivated choice of loss function, we show performing this optimization is tractable. In fact, it corresponds to a recently proposed method for dimensionality reduction. ...

2015
N Davies J Manthorpe E L Sampson S Iliffe

INTRODUCTION End of life care guidance for people with dementia is lacking and this has been made more problematic in England with the removal of one of the main end of life care guidelines which offered some structure, the Liverpool Care Pathway. This guidance gap may be eased with the development of heuristics (rules of thumb) which offer a fast and frugal form of decision-making. OBJECTIVE...

Journal: :Lecture Notes in Computer Science 2021

This paper presents preliminary work on using deep neural networks to guide general-purpose heuristic algorithms for performing utilitarian combinatorial assignment. In more detail, we use learning in an attempt produce heuristics that can be used together with e.g., search generate feasible solutions of higher quality quickly. Our results indicate our approach could a promising future method c...

1994
Guoning Liao Erik R. Altman Vinod K. Agarwal Guang R. Gao

This paper presents a quantitative comparison of a collection of DSP multiprocessor list scheduling heuristics which consider inter-processor communication delays. The following aspects have been addressed: (1) performance in terms of the total execution time (makespan), (2) sensitivity of heuristics in terms of the characteristics of acyclic precedence graphs, including graph size and graph pa...

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

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