12,898 Hits in 4.3 sec

Recent Progress in the Design and Analysis of Admissible Heuristic Functions [chapter]

Richard E. Korf
2000 Lecture Notes in Computer Science  
In addition, we have learned how to accurately predict the running time of admissible heuristic search algorithms, as a function of the solution depth and the heuristic evaluation function.  ...  One corollary of this analysis is that an admissible heuristic function reduces the effective depth of search, rather than the effective branching factor.  ...  Acknowledgements I would like to thank my collaborators in this work, including Stefan Edelkamp, Ariel Felner, Michael Reid, and Larry Taylor. This research was sponsored by NSF grant No.  ... 
doi:10.1007/3-540-44914-0_3 fatcat:pgxu3psog5fappg5b3or4fggka

A Motivational Model of BCI-Controlled Heuristic Search

Marc Cavazza
2018 Brain Sciences  
Our framework is based on a joint analysis of philosophical proposals characterising the behaviour of autonomous AI systems and recent research in cognitive neuroscience that support the design of appropriate  ...  The actual mapping is based on a measure of prefrontal asymmetry, which is translated into a non-admissible variant of the heuristic function.  ...  Acknowledgments: Gabor Aranyi and Fred Charles had an essential contribution to the proof-of-concept experiments whose results are discussed in Section 3 of this paper: details of their respective contributions  ... 
doi:10.3390/brainsci8090166 pmid:30200321 pmcid:PMC6162724 fatcat:nive4og5hrhvpewprvdnxcnpsu

Artificial intelligence, heuristic frameworks and tabu search

Fred Glover
1990 Managerial and Decision Economics  
Finally, we discuss briefly the relevance of a supplementary framework, called target analysis, which is a method for determining good decision rules to enable heuristics to perform more effectively. 0143  ...  (in contrast to 'memoryless^ systems, as in simulated annealing and genetic algorithms, and rigid memory systems as in branch and bound and A* search).  ...  Acknowledgement This research has been supported in part by the NASA Grant NAGQ-1388 of the Center for Space Construction and by the Air Force Office Scientific Research and the Office of Naval Research  ... 
doi:10.1002/mde.4090110512 fatcat:xgvzlmz565cxrm33dgtx4jhs4m

Admissible Moves in Two-Player Games [chapter]

Tristan Cazenave
2002 Lecture Notes in Computer Science  
We analyze the benefits of these admissible heuristics on moves for rules generation and search. We give experimental results that support our claim for the game of AtariGo.  ...  Some games have abstract properties that can be used to design admissible heuristics on moves. These admissible heuristics are useful to speed up search.  ...  More recently, Abstract Proof Search [3] and Lambda Search [4] were designed and have outperformed basic Alpha-Beta search in the capture game of Go.  ... 
doi:10.1007/3-540-45622-8_5 fatcat:hop6boee6rhkdajwlpywcfjjqe

The PANDA Framework for Hierarchical Planning

Daniel Höller, Gregor Behnke, Pascal Bercher, Susanne Biundo
2021 Künstliche Intelligenz  
AbstractDuring the last years, much progress has been made in hierarchical planning towards domain-independent systems that come with sophisticated techniques to solve planning problems instead of relying  ...  on advice in the input model.  ...  We recently described two new heuristic approaches. In the family of heuristics presented in Höller et al.  ... 
doi:10.1007/s13218-020-00699-y fatcat:c6odx47a7bbz5ow755o6zaate4

Usability Evaluation of Three Admission and Medical Records Subsystems Integrated into Nationwide Hospital Information Systems: Heuristic Evaluation

Mehrdad Farzandipour, Ehsan Nabovati, GholamHosein Zaeimi, Reza Khajouei
2018 Acta Informatica Medica  
Methods: In this descriptive study the usability of admission and medical records module of three HISs (HIS1, HIS2, and HIS3) was evaluated using heuristic evaluation method.  ...  The heuristics of "help and documentation", "flexibility and efficiency of use", and "visibility of system status" in the three HISs were categorized into the "highest rate of problems", "lowest rate of  ...  To reduce the severity of problems related to this heuristic, it is recommended that the UI of information systems to be designed in such a way that it always informs user of system status and task progress  ... 
doi:10.5455/aim.2018.26.133-138 pmid:30061787 pmcid:PMC6029901 fatcat:m2626j3vjnggxbrsql2bnqkid4

Physical Medicine for Health and Recovery

Naoyuki Takeuchi
2017 International Journal of Physical Medicine & Rehabilitation  
Various modifications in the main theme of physical exercise have been observed in recent time in the name of 'Physical therapy' or 'Physiotherapy' .  ...  Underlying the improved gait performance was the emergence of functional muscle activity in the paralyzed and spastic leg muscles.  ...  mFIM effectiveness, deviation value of mFIM gain, and multiple regression analysis.  ... 
doi:10.4172/2329-9096.1000e121 fatcat:dtzxzww2zrfjdkamepzok5k2vi

A geometric analysis of heuristic search

Gordon J. Vanderbrug
1976 Proceedings of the June 7-10, 1976, national computer conference and exposition on - AFIPS '76  
This geometric representation is used to prove some formal properties of heuristic search strategies involving completeness, admissibility, optimality, consistency, and the use of the perfect heuristic  ...  The geometric analysis provides an intuitive alternative to the algebraic analysis which appears in the literature.  ...  ACKNOWLEDGMENTS The support of the National Aeronautics and Space Administration under Grant NGR-2I-002-270, and the assistance of L. Kanal, J. Minker and A. Rosenfeld is gratefully acknowledged.  ... 
doi:10.1145/1499799.1499934 dblp:conf/afips/Vanderbrug76 fatcat:ig6patzemzhs3jjrsrtyjb37vy

Hybrid heuristic search for the scheduling of flexible manufacturing systems using Petri nets

A.R. Moro, H. Yu, G. Kelleher
2002 IEEE Transactions on Robotics and Automation  
The combination of Petri nets (PNs) as an analysis tool for discrete-event dynamic systems and artificial intelligence heuristic search has been shown to be a promising way to solve flexible manufacturing  ...  Comparison with previous work is given to show the superiority of our approach and the potential of PN-based heuristic search.  ...  Heuristic Function h RCR The heuristic function h RCR [12] employed in DLSS 3 is an admissible one [9] and solves an alternate problem: the minimization of the total machine utilization, which represent  ... 
doi:10.1109/tra.2002.999652 fatcat:3ndny724frg6dpbfzcujhukppa


Christophe Alias, Fabrice Baray, Alain Darte
2007 SIGPLAN notices  
Thus, even in the case where the designer wants to choose the modular mapping him/herself, instead of relying on heuristics, it is very useful to be able to use an automated analysis to compute this fundamental  ...  . , ai−1)}, which is connected to the gauge function of the projection of K along the vectors a1, . . . , ai−1. The next heuristic uses the functions Fi.  ... 
doi:10.1145/1273444.1254778 fatcat:cjp56tutora27kfaiphfpqjwx4

Everything You Always Wanted to Know about Planning [chapter]

Jörg Hoffmann
2011 Lecture Notes in Computer Science  
put on socks and shoes (not to mention the disposal of bombs in toilets).  ...  The area has long had an affinity towards playful illustrative examples, imprinting it on the mind of many a student as an area concerned with the rearrangement of blocks, and with the order in which to  ...  I am grateful to all my colleagues from the planning community, and I thank them specifically for their work as described and cited herein. I hope we'll still be friends after you read this.  ... 
doi:10.1007/978-3-642-24455-1_1 fatcat:ld5ob7teurbdpbzq3dko7bbik4

Guided model checking for programs with polymorphism

Neha Rungta, Eric G. Mercer
2008 Proceedings of the 2009 ACM SIGPLAN workshop on Partial evaluation and program manipulation - PEPM '09  
In our empirical analysis the state of the art approach is computationally infeasible for large programs with polymorphism while our new distance heuristic can quickly detect the errors.  ...  In this paper we describe a new distance estimate heuristic that efficiently computes a tighter lower-bound in programs with polymorphism when compared to the state of the art distance heuristic.  ...  The e-FCA heuristic is, however, not designed to compute distance estimates in the presence of dynamic method invocations whose targets cannot be statically resolved using a type analysis.  ... 
doi:10.1145/1480945.1480950 dblp:conf/pepm/RungtaM09 fatcat:mqpjudbqxvefdnm6rzv3c35h6m

A*-Connect: Bounded suboptimal bidirectional heuristic search

Fahad Islam, Venkatraman Narayanan, Maxim Likhachev
2016 2016 IEEE International Conference on Robotics and Automation (ICRA)  
In this work, we leverage recent advances in search with inadmissible heuristics to develop an algorithm called A*-Connect, much in the spirit of RRT-Connect.  ...  Admissible heuristics for the connection of forward and backward searches have been developed, but their computational complexity is a deterrent.  ...  ACKNOWLEDGMENTS This work was supported by NSF grant IIS-1409549 and ONR grant N00014-15-1-2129.  ... 
doi:10.1109/icra.2016.7487437 dblp:conf/icra/IslamNL16 fatcat:tudi6pir4bcqzmqnqd6a56cyxq


Christophe Alias, Fabrice Baray, Alain Darte
2007 Proceedings of the 2007 ACM SIGPLAN/SIGBED conference on Languages, compilers, and tools - LCTES '07  
The second part, Cl@k, is a stand-alone mathematical tool dedicated to optimizations on polyhedra, in particular the computation of successive minima and the computation of good admissible lattices, which  ...  Both tools are developed in C++ and use linear programming and polyhedra manipulations.  ...  Thus, even in the case where the designer wants to choose the modular mapping him/herself, instead of relying on heuristics, it is very useful to be able to use an automated analysis to compute this fundamental  ... 
doi:10.1145/1254766.1254778 dblp:conf/lctrts/AliasBD07 fatcat:pszlxltnhrct5pmvabzwje4nzm

A Survey and Comparative Study of Hard and Soft Real-Time Dynamic Resource Allocation Strategies for Multi-/Many-Core Systems

Amit Kumar Singh, Piotr Dziurzanski, Hashan Roshantha Mendis, Leandro Soares Indrusiak
2017 ACM Computing Surveys  
Multi/Many-core systems are envisioned to satisfy the ever increasing performance requirements of complex applications in various domains such as embedded and high performance computing (HPC).  ...  This article provides an extensive survey of hard and soft real-time dynamic resource allocation strategies proposed over the last two decades and highlights the emerging trends for multi/many-core systems  ...  A few works have been recently reported that utilize design-time computed results for dynamic resource allocation while applying schedulability analysis, but these fall in the category of hybrid resource  ... 
doi:10.1145/3057267 fatcat:ykfrc5lytnehxncsp3wdmvi5uy
« Previous Showing results 1 — 15 out of 12,898 results