Abstract The Examination Timetabling problem regards the scheduling for the exams of a set of university courses, avoiding the overlapping of exams having students in common, fairl...
This paper develops a measure for bounding the performance of AND/OR search algorithms for solving a variety of queries over graphical models. We show how drawing a connection to ...
Many perception, reasoning, and learning problems can be expressed as Bayesian inference. We point out that formulating a problem as Bayesian inference implies specifying a probabi...
Commercial search engines, especially meta-search engines was designed to retrieve the information by submitting users' queries to multiple conventional search engines and in...
When searching the space of possible plans for combined planning and scheduling problems we often reach a local maximum and must either backtrack or otherwise modify the plan to m...