Search
Skip to Search Results- 9Culberson, Joseph
- 9Holte, Robert
- 3Harms, Janelle
- 3Li, Yuxi
- 2Schaeffer, Jonathan
- 1Amaral, Jose Nelson
- 3Abstractions
- 1A* algorithm
- 1Algorithm efficiency
- 1Algorithmics
- 1Artificial Intelligence
- 1Asymmetries
-
2005
Li, Yuxi, Harms, Janelle, Holte, Robert
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...
-
2004
Hernadvolgyi, Istvan, Holte, Robert
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...
-
1997
Technical report TR97-02. It is shown that the popular puzzle Sokoban can be used to emulate a linear bounded automata (finite tape Turing Machine (TM)). In particular, a construction is given that has a solution if and only if the corresponding Turing Machine on its input halts in the accept...
-
2014
Burch, Neil, Holte, Robert, Arneson, Broderick
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...
-
On the Futility of Blind Search
1996
Technical report TR96-18. This paper might have been subtitled \"An algorithmicist looks at no free lunch.\" We use simple adversary arguments to redevelop and explore some of the no free lunch (NFL) theorems and perhaps extend them a little. A second goal is to clarify the relationship of NFL...
-
1988
Culberson, Joseph, Rawlins, Gregory
Technical report TR88-01. A great deal of effort has been directed towards determining the minimum number of binary comparisons sufficient to produce various partial orders given some partial order. For example, the sorting problem considers the minimum number of comparisons sufficient to...
-
Multipath Oblivious Routing for Traffic Engineering - Stable and Robust Routing in Changing and Uncertain Environments
Download2006
Li, Yuxi, Bai, Baochun, Harms, Janelle, Holte, Robert
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...
-
1992
Technical report TR92-06. This document describes the gene invariant genetic algorithm (GIGA) program. This program represents a unique approach to designing GAs with many interesting results. The primary distinguishing feature is that when a pair of offspring are created and chosen as worthy...
-
1992
Technical report TR92-02. This paper presents some experimental results and analyses of the gene invariant genetic algorithm(GIGA). Although a subclass of the class of genetic algorithms, this algorithm and its variations represent a unique approach with many interesting results. The primary...