No more "Partial" and "Full Looking Ahead"
نویسنده
چکیده
Looking ahead is a commonly used search technique in constraint satisfaction. In this paper, we examine the future role of two long established lookahead algorithms, Partial Looking Ahead (PLA) and Full Looking Ahead (FLA). We prove that PLA is inferior to Directional Arcconsistency Lookahead in that the latter will prune at least as much as the former for no more computation in each problem reduction step. Similarly, FLA is inferior to Bi-directional Arcconsistency Lookahead, an algorithm introduced in this paper. We also point out a couple of errors in fhe literature. @ 1998 Elsevier Science B.V.
منابع مشابه
Looking at Full Looking Ahead
Haralick and Elliott's full looking ahead algorithm [4] was presented in the same article as forward checking, but is not as commonly used. We give experimental results which indicate that on some types of constraint satisfaction problems, full looking ahead outperforms forward checking. We also present three new looking ahead algorithms, all variations on full looking ahead, which were designe...
متن کاملLooking at Globalization of English in the Context of Internationalism
The present study is an attempt to provide a current synopsis of World Englishes within globalized communities, as well as theoretical and applied feasibility of global linguistic features of English as an International Language (EIL). To do so, first, three main reactions against the spread of English by scholars around the world are discussed. Then, the possibility of describing and teaching ...
متن کاملاثر کاربرد روش‌های آبیاری موضعی ریشه (PRD) بر راندمان مصرف آب، عملکرد و اجزای عملکرد گوجه‌فرنگی
Four partial root zone drying (FULL, 1PRD50, 2PRD50, 3PRD50) treatments were investigated on tomato characteristics and water use efficiency using completely randomized design with five replications. In the control treatment (Full irrigation), all water requirement of plant was met in the root area equally during the growing season. Roots in 1PRD50, 2PRD50 and 3PRD50 treatments were divided int...
متن کاملLook-Ahead Value Ordering for Constraint Satisfaction Problems
Looking ahead during search is often useful when solving constraint satisfaction problems. Previous studies have shown that looking ahead helps by causing dead-ends to occur earlier in the search, and by providing information that is useful for dynamic variable ordering. In this paper, we show that another bene t of looking ahead is a useful domain value ordering heuristic, which we call look-a...
متن کاملHigh Speed-Low Power Radix-8 Booth Decoded Multiplier
This paper proposed a new method for adding sum and carry using carry look-ahead adder at the final stage of the radix-8 booth decoding multiplier. In a conventional radix-8 booth decoded multiplier, full adders and half adders are used to add sum and carry. After partial product reduction using booth decoding, the partial product rows are required to add for final result. In this method carry ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Artif. Intell.
دوره 98 شماره
صفحات -
تاریخ انتشار 1998