SearchSkip to Search Results
- 1Artificial Intelligence
- 1Asymmetric Traveling Salesman Problem
- 1Downward path preserving property
- 1Energy efficiency
- 1Heuristic Search
Technical report TR07-06. The effectiveness of heuristics search is influnced by the accuracy of the heuristic values. State space abstractions have been proved to be effective for generating admissible heuristics. In this paper, A general definition for abstractions is given. As a demonstration...
Technical report TR08-05. The following report describes some techniques that generalize and attempt to improve upon the Coarse-to-Fine Dynamic Programming (CFDP) algorithm developed by Christopher Raphael. CFDP uses a hierarchy of abstraction graphs, iteratively searches to find optimal...
Technical report TR09-04. Abstraction is a popular technique for speeding up planning and search. A problem that often arises in using abstraction is the generation of abstract states, called spurious states, from which the goal state is reachable in the abstract space but for which there is no...
Technical report TR08-18. We present an advanced Bidirectional A* algorithm featuring an application of Frontier Search and a strategy for the performance-efficient utilization of External Memory. We present the results of an experimental evaluation demonstrating that this algorithm is capable of...
Technical report TR06-22. QoS routing has been shown to be NP-hard. A recent study of its hardness shows that the ``worst-case'' may not occur in practice . This suggests that there may exist fast exact algorithms for the multi-constraint shortest path (MCSP) problem, an instance of QoS...
Multipath Oblivious Routing for Traffic Engineering - Stable and Robust Routing in Changing and Uncertain EnvironmentsDownload
Technical report TR06-11. Intra-domain traffic engineering is essential for the operation of an Internet Service Provider (ISP). Demand-oblivious routing (Applegate and Cohen 2003) promises excellent performance guarantee with changing and uncertain traffic demands. However, it is non-trivial...
This manual describes PSVN, a language for describing state space search problems using multi-valued variables that lends itself to efficient calculation of state's successors and predecessors without having to fully ground the operators. It also describes the PSVN compiler, psvn2c, which accepts...
Technical report TR03-16. The Sequential Ordering Problem (SOP) is a version of the Asymmetric Traveling Salesman Problem (ATSP) where precedence constraints on the vertices must be observed. The SOP has many real life applications and it has proved to be a challenge as there are SOPs of order...
Technical report TR04-02. The long-term goal of our research is to develop robust methods that use abstraction to create heuristics automatically from a description of a search space. Our research has progressed significantly towards this goal. This paper reviews the current state of the art, and...
Technical report TR05-24. Energy efficiency is an important issue in multihop wireless networks with energy concerns. Usually it is achieved with accurate knowledge of the traffic pattern and/or the current network information such as load and remaining energy level (in an energy constrained...