Heuristic forward search is the dominant approach to satisficing planning to date. Most successful planning systems, however, go beyond plain heuristic search by employing various...
Two base algorithms are known for reachability verification over timed automata. They are called forward and backwards, and traverse the automata edges using either successors or p...
In traditional mathematical models of argumentation an argument often consists of a chain of rules or reasons, beginning with premisses and leading to a conclusion that is endorse...
In self-organized mobile ad hoc networks (MANETs) where each user is its own authority, fully cooperative behaviors, such as unconditionally forwarding packets for each other or ho...
IP traffic on the Internet and private enterprise networks has been growing exponentially for some time. This growth is beginning to stress the traditional, processor based design...