To anti-collision problem of multiple tags of RFID in ETC (Electronic Toll Collection) system, a novel BBS (Backtracking Binary-tree Search ) anti-collision algorithm is proposed in working in UHF (5.8G) based on the DBS (Dynamic Binary-tree Search) and RSBS (Random Split Binary-tree Search) to solve the only one bit collision in inquiry. The BBS algorithm can reduce twice inquiry process. The ...

The ATMS (A ssumption-Based Truth Maintenance Systern) provides a very general futility ior all types of default reasoning. One of the principal advantages of the ATMS is that cl11 of the possible (usually mutually inconsistent) solutions or partial solutions are directly available to the problem solver. By exploiting this capability of the ATMS, the problem solver can eficiently work on all so...

In the scope of distributed constraint reasoning, the main algorithms presented so far have a feature in common: the addition of links between previously unrelated agents, before or during search. This paper presents a new search procedure for finding a solution in a distributed constraint satisfaction problem. This algorithm makes use of some of the good properties of centralised dynamic backt...

Multi-Point Constructive Search maintains a small set of “elite solutions” that are used to heuristically guide constructive search through periodically restarting search from an elite solution. Empirical results indicate that for job shop scheduling optimization problems, multi-point constructive search leads to significantly better solutions for equivalent search effort when compared to chron...

Abstract: We analyze two algorithms for solving constraint satisfaction problems. One of these algorithms, Probe Order Backtracking, has an average running time much faster than any previously analyzed algorithm for problems where solutions are common. Probe Order Backtracking uses a probing assignment (a preselected test assignment to unset variables) to help guide the search for a solution to...

This paper presents an artificial intelligence based heuristic search algorithm for resource-constrained project scheduling problems. The search process starts from an empty schedule and ends in a complete schedule. The procedure follows a stepwise generation of partial schedules that are connected by a lower bound on completion of unscheduled activities. A higher value of lower bound in a new ...

The algorithm for constraint-satisfaction problems, Probe Order Backtracking, has an average running time much faster than any previously analyzed algorithm under conditions where solutions are common. The algorithm uses a probing assignment (a preselected test assignment to unset variables) to help guide the search for a solution. If the problem is not satisfied when the unset variables are te...

ÐThis paper introduces GRASP (Generic seaRch Algorithm for the Satisfiability Problem), a new search algorithm for Propositional Satisfiability (SAT). GRASP incorporates several search-pruning techniques that proved to be quite powerful on a wide variety of SAT problems. Some of these techniques are specific to SAT, whereas others are similar in spirit to approaches in other fields of Artificia...