Bibliography
Adelson-Velskiy, G.; Arlazarov, V.; Donskoy, M., Some methods of controlling the search tree in chess programs, Artificial Intelligence 6 (4) (2003) 361–371.
Aggarwal, S.; Alonso, R.; Courcoubetis, C., Distributed reachability analysis for protocol verification environments, In: Discrete Event Systems: Models and Application Lecture Notes in Control and Information Sciences, Vol. 103 (1988), pp. 40–56.
Aggarwal, A.; Vitter, J.S., Complexity of sorting and related problems, In: ICALP (1987), pp. 467–478; no..
Aggarwal, A.; Vitter, J.S., The input/output complexity of sorting and related problems, Journal of the ACM 31 (9) (1988) 1116–1127.
Agre, P.; Chapman, D., Pengi: An implementation of a theory of activity, In: AAAI (1987), pp. 268–272.
Aho, A.V.; Corasick, M.J., Efficient string matching: An aid to bibliographic search, Communications of the ACM 18 (6) (1975) 333–340.
Ahuja, R.K.; Magnanti, T.L.; Orlin, J.B., Networks flows, In: Handbooks in Operation Research and Management Science (1989); North-Holland.
Akers, S.B., Binary decision diagrams, IEEE Transactions on Computers 27 (6) (1978) 509–516.
Albers, S.; Henzinger, M., Exploring unknown environments, SIAM Journal on Computing 29 (4) (2000) 1164–1188.
Alcázar, V.; Borrajo, D.; Linares López, C., Using backwards generated goals for heuristic planning, In: ICAPS (2010), pp. 2–9.
Allen, J.D., The Complete Book of Connect 4: History, Strategy, Puzzles. (2010) Sterling Publishing .
Allis, L.V.; van der Meulen, M.; van den Herik, H.J., Proof-number search, Artificial Intelligence 66 (1994) 91–124.
Altschul, S.; Gish, W.; Miller, W.; Myers, E.; Lipman, D., Basic local alignment search tool, Journal of Molecular Biology 215 (1990) 403–410.
Alur, R.; Dill, D.L., A theory of timed automata, Theoretical Computer Science 126 (2) (1994) 183–235.
Ambite, J.; Knoblock, C., Planning by rewriting: Efficiently generating high-quality plans, In: AAAI (1997), pp. 706–713.
Amir, A.; Farach, M.; Galil, Z.; Giancarlo, R.; Park, K., Dynamic dictionary matching, Journal of Computer and System Sciences 49 (2) (1994) 208–222.
Amir, A.; Farach, M.; Idury, R.M.; La Poutré, J.A.; Schäffer, A., Improved dynamic dictionary matching, Information and Computation 119 (2) (1995) 258–282.
Anantharaman, T.S.; Campbell, M.S.; Hsu, F.H., Singular extensions: Adding selectivity to brute force search, Artificial Intelligence 43 (1) (1990) 99–110.
Anderson, K.; Schaeffer, J.; Holte, R.C., Partial pattern databases, In: SARA (2007), pp. 20–34.
Angluin, D., Learning regular sets from queries and counterexamples, Information and Computation 75 (1987) 87–106.
Aragon, C.R.; Seidel, R.G., Randomized search trees, In: FOCS (1989), pp. 540–545.
Arge, L.; Knudsen, M.; Larsen, K., Sorting multisets and vectors in-place, In: WADS (1993), pp. 83–94.
Aspvall, B.; Plass, M.B.; Tarjan, R.E., A linear-time algorithm for testing the truth of certain quantified Boolean formulas, Information Processing Letters 8 (3) (1979) 121–123.
Atkinson, M.D.; Sack, J.R.; Santoro, N.; Strothotte, T., Min-max heaps and generalized priority queues, Communications of the ACM 29 (1986) 996–1000.
Auer, P.; Cesa-Bianchi, N.; Fischer, P., Finite-time analysis of the multiarmed bandit problem, Machine Learning 47 (2/3) (2002) 235–256.
Ausiello, G.; Italiano, G.; Marchetti-Spaccamela, A.; Nanni, U., Incremental algorithms for minimal length paths, Journal of Algorithms 12 (4) (1991) 615–638.
Avriel, M., Nonlinear Programming: Analysis and Methods. (1976) Prentice-Hall .
Bacchus, F.; Kabanza, F., Using temporal logics to express search control knowledge for planning, Artificial Intelligence 116 (2000) 123–191.
Bäckström, C.; Nebel, B., Complexity results for SAS+ planning, Computational Intelligence 11 (4) (1995) 625–655.
Baeza-Yates, R.; Culberson, J.; Rawlins, G., Searching in the plane, Information and Computation 2 (1993) 234–252.
Baeza-Yates, R.; Gonnet, G.H., A new approach to text searching, Communications of the ACM 35 (10) (1992) 74–82.
Bagchi, A.; Mahanti, A., Search algorithms under different kinds of heuristics—A comparative study, Journal of the ACM 30 (1) (1983) 1–21.
Bagchi, A.; Mahanti, A., Three approaches to heuristic search in networks, Journal of the ACM 32 (1) (1985) 1–27.
Baier, J.; McIlraith, S.A., Planning with first-order temporally extended goals using heuristic search, In: AAAI (2006), pp. 788–795.
Bakera, M.; Edelkamp, S.; Kissmann, P.; Renner, C.D., Solving mu-calculus parity games by symbolic planning, In: MOCHART (2008), pp. 15–33.
Balch, T.; Arkin, R., Avoiding the past: A simple, but effective strategy for reactive navigation, In: International Conference on Robotics and Automation (1993), pp. 678–685.
Baldan, P.; Corradini, A.; König, B.; König, B., Verifying a behavioural logic for graph transformation systems, ENTCS 104 (2004) 5–24.
Ball, M.; Holte, R.C., The compression power of BDDs, In: ICAPS (2008), pp. 2–11.
Ball, T.; Majumdar, R.; Millstein, T.D.; Rajamani, S.K., Automatic predicate abstraction of C programs, In: PLDI (2001), pp. 203–213.
Barnat, J.; Brim, L.; Cerná, I.; Moravec, P.; Rockai, P.; Simecek, P., DiVinE—A tool for distributed verification, In: CAV (2006), pp. 278–281.
Barnat, J.; Brim, L.; Chaloupka, J., Parallel breadth-first search LTL model-checking, In: IEEE International Conference on Automated Software Engineering (2003) IEEE Computer Society, pp. 106–115.
Barnat, J.; Brim, L.; Simecek, P., I/O-efficient accepting cycle detection, In: CAV (2007), pp. 316–330.
Barto, A.; Bradtke, S.; Singh, S., Learning to act using real-time dynamic programming, Artificial Intelligence 72 (1) (1995) 81–138.
Bartzis, C.; Bultan, T., Efficient BDDs for bounded arithmetic constraints, International Journal on Software Tools for Technology Transfer 8 (1) (2006) 26–36.
Bast, H.; Funke, S.; Sanders, P.; Schultes, D., Fast routing in road networks with transit nodes, Science 316 (5824) (2007) 566.
Batalin, M.; Sukhatme, G., Coverage, exploration and deployment by a mobile robot and communication network, Telecommunication Systems Journal: Special Issue on Wireless Sensor Networks 26 (2) (2004) 181–196.
Baumer, S.; Schuler, R., Improving a probabilistic 3-SAT algorithm by dynamic search and independent clause pairs, In: SAT (2003), pp. 150–161.
Behrmann, G.; Hune, T.S.; Vaandrager, F.W., Distributed timed model checking—How the search order matters, In: CAV (2000), pp. 216–231.
Bellman, R., On a routing problem, Quarterly of Applied Mathematics 16 (1) (1958) 87–90.
Bentley, J.L.; Ottmann, T.A., Algorithms for reporting and counting geometric intersections, Transactions on Computing 28 (1979) 643–647.
Bercher, P.; Mattmüller, R., A planning graph heuristic for forward-chaining adversarial planning, In: ECAI (2008), pp. 921–922.
Berger, A.; Grimmer, M.; Müller-Hannemann, M., Fully dynamic speed-up techniques for multi-criteria shortest path searches in time-dependent networks, In: SEA (2010), pp. 35–46.
Berlekamp, E.R.; Conway, J.H.; Guy, R.K., Winning Ways. (1982) Academic Press .
Bertsekas, D.P., Nonlinear Programming. (1999) Athena Scientific .
Bessiere, C., Arc-consistency and arc-consistency again, Artificial Intelligence 65 (1994) 179–190.
Bessiere, C.; Regin, J.-C., Refining the basic constraint propagation algorithm, In: IJCAI (2001), pp. 309–315.
Bessiere, C.; Freuder, E.C.; Regin, J.-C., Using constraint metaknowledge to reduce arc consistency computation, Artificial Intelligence 107 (1999) 125–148.
Biere, A., μcke-efficient μ-calculus model checking, In: CAV (1997), pp. 468–471.
Biere, A.; Cimatti, A.; Clarke, E.; Zhu, Y., Symbolic model checking without BDDs, In: TACAS (1999), pp. 193–207.
Bisani, R., Beam search, In: Encyclopedia of Artificial Intelligence (1987), pp. 56–58.
Bistarelli, S.; Montanari, U.; Rossi, F., Semiring-based constraint satisfaction and optimization, Journal of the ACM 44 (2) (1997) 201–236.
Bjørnsson, Y.; Bulitko, V.; Sturtevant, N., TBA*: Time-Bounded A*, Proceedings of the International Joint Conference on Artificial Intelligence (2009) 431–436.
Bloem, R.; Ravi, K.; Somenzi, F., Symbolic guided search for CTL model checking, In: DAC (2000), pp. 29–34.
Bloom, B., Space/time trade-offs in hashing coding with allowable errors, Communication of the ACM 13 (7) (1970) 422–426.
Blum, A.; Furst, M.L., Fast planning through planning graph analysis, In: IJCAI (1995), pp. 1636–1642.
Blum, A.; Raghavan, P.; Schieber, B., Navigation in unfamiliar terrain, In: STOC (1991), pp. 494–504.
Blum, A.; Raghavan, P.; Schieber, B., Navigating in unfamiliar geometric terrain, SIAM Journal on Computing 26 (1) (1997) 110–137.
Bnaya, Z.; Felner, A.; Shimony, S.E., Canadian traveler problem with remote sensing, In: IJCAI (2009), pp. 437–442.
Bollig, B.; Leucker, M.; Weber, M., Parallel model checking for the alternation free μ-calculus, In: TACAS (2001), pp. 543–558.
Bonasso, R.; Kortenkamp, D.; Murphy, R., Xavier: A Robot Navigation Architecture Based on Partially Observable Markov Decision Process Models. (1998) MIT Press .
Bonet, B., Efficient algorithms to rank and unrank permutations in lexicographic order, In: AAAI-Workshop on Search in AI and Robotics (2008).
Bonet, B.; Geffner, H., Planning with incomplete information as heurstic search in belief space, In: AIPS (2000), pp. 52–61.
Bonet, B.; Geffner, H., Planning as heuristic search, Artificial Intelligence 129 (1–2) (2001) 5–33.
Bonet, B.; Geffner, H., An algorithm better than AO*? In: AAAI (2005), pp. 1343–1348.
Bonet, B.; Geffner, H., Learning depth-first: A unified approach to heuristic search in deterministic and non-deterministic settings, and its application to MDPs, In: ICAPS (2006), pp. 142–151.
Bonet, B.; Geffner, H., Heuristics for planning with penalties and rewards formulated in logic and computed through circuits, Artificial Intelligence 172 (2008) 1579–1604.
Bonet, B.; Helmert, M., Strengthening landmark heuristics via hitting sets, In: ECAI (2010), pp. 329–334.
Bonet, B.; Haslum, P.; Hickmott, S.L.; Thiébaux, S., Directed unfolding of petri nets, T. Petri Nets and Other Models of Concurrency 1 (2008) 172–198.
Bonet, B.; Loerincs, G.; Geffner, H., A robust and fast action selection mechanism for planning, In: AAAI (1997), pp. 714–719.
Bornot, S.; Morin, R.; Niebert, P.; Zennou, S., Black box unfolding with local first search, In: TACAS (2002), pp. 241–257.
Borowsky, B.; Edelkamp, S., Optimal metric planning with state sets in automata representation, In: AAAI (2008), pp. 874–879.
Bosnacki, D., Black box checking for biochemical networks, In: CMSB (2004), pp. 225–230.
Bosnacki, D.; Edelkamp, S.; Sulewski, D., Efficient probabilistic model checking on general purpose graphics processors, In: SPIN (2009), pp. 32–49.
Botea, A.; Müller, M.; Schaeffer, J., Learning partial-order macros from solutions, In: ICAPS (2005), pp. 231–240.
Botelho, F.C.; Pagh, R.; Ziviani, N., Simple and space-efficient minimal perfect hash functions, In: WADS (2007), pp. 139–150.
Botelho, F.C.; Ziviani, N., External perfect hashing for very large key sets, In: CIKM (2007), pp. 653–662.
Brafman, R.; Chernyavsky, Y., Planning with goal preferences and constraints, In: ICAPS (2005), pp. 182–191.
Barto, A.G.; Bradtke, S.J.; Singh, S.P., Learning to act using real-time dynamic programming, Artificial Intelligence 72 (1) (1995) 81–138.
Breiman, L.; Friedman, J.H.; Olshen, R.A.; Stone, C.J., Classification and Regression Trees. (1984) Wadsworth .
Breitbart, Y.; Hunt, H.; Rosenkrantz, D., Switching circuits by binary decision diagrams, Bell System Technical Journal 38 (1992) 985–999.
Breitbart, Y.; Hunt, H.; Rosenkrantz, D., On the size of binary decision diagrams representing Boolean functions, Theoretical Computer Science 145 (1995) 45–69.
Brengel, K.; Crauser, A.; Meyer, U.; Ferragina, P., An experimental study of priority queues in external memory, In: WAE (1999), pp. 345–359.
Breyer, T.M.; Korf, R.E., Recent results in analyzing the performance of heuristic search, In: AAAI, Workshop on Search Techniques in Artificial Intelligence and Robotics (2008).
Breyer, T.M.; Korf, R.E., Independent additive heuristics reduce search multiplicatively, In: AAAI (2010), pp. 33–38.
Breyer, T.M.; Korf, R.E., 1.6-bit pattern databases, In: AAAI (2010), pp. 39–44.
Briel, M.; Sanchez, R.; Do, M.; Kambhampati, S, Effective approaches for partial satisfaction (oversubscription) planning, In: AAAI (2004), pp. 562–569.
Brodal, G.S., Worst-case efficient priority queues, In: SODA (1996), pp. 52–58.
Brodnik, A.; Munro, J.M., Membership in constant time and almost-minimum space, SIAM Journal of Computing 28 (3) (1999) 1627–1640.
Brooks, R., A robust layered control system for a mobile robot, IEEE Journal of Robotics and Automation RA-2 (1986) 14–23.
Bruegmann, B., Monte-Carlo Go. (1993) ; Unpublished manuscript.
Bruengger, A.; Marzetta, A.; Fukuda, K.; Nievergelt, J., The parallel search bench ZRAM and its applications, Annals of Operation Research 90 (1999) 25–63.
Brumitt, B.; Stentz, A., GRAMMPS: A generalized mission planner for multiple mobile robots, In: ICRA (1998).
Brüntrup, R.; Edelkamp, S.; Jabbar, S.; Scholz, B., Incremental map generation with GPS traces, In: ITSC (2005), p. 2005.
Bruun, A.; Edelkamp, S.; Katajainen, J.; Rasmussen, J., Policy-based benchmarking of weak heaps and their relatives, In: SEA (2010), pp. 424–435.
Bryant, R.E., Symbolic Boolean manipulation with ordered binary-decision diagrams, ACM Computing Surveys 24 (3) (1992) 142–170.
Buchsbaum, A.; Goldwasser, M.; Venkatasubramanian, S.; Westbrook, J., On external memory graph traversal, In: Symposium on Discrete Algorithms (SODA) (2000), pp. 859–860.
Bulitko, V.; Lee, G., Learning in real-time search: A unifying framework, Journal of Artificial Intelligence Research 25 (2006) 119–157.
Bulitko, V.; Sturtevant, N.; Kazakevich, M., Speeding up learning in real-time search via automatic state abstraction, In: AAAI (2005), pp. 1349–1354.
Burgard, W.; Fox, D.; Moors, M.; Simmons, R.; Thrun, S., Collaborative multi-robot exploration, In: ICRA (2000), pp. 476–481.
Burns, E.; Lemons, S.; Ruml, W.; Zhou, R., Suboptimal and anytime heuristic search on multi-core machines, In: ICAPS (2009).
Burns, E.; Lemons, S.; Zhou, R.; Ruml, W., Best-first heuristic search for multi-core machines, In: IJCAI (2009), pp. 449–455.
Bylander, T., The computational complexity of propositional STRIPS planning, Artificial Intelligence (1994) 165–204.
Caires, L.; Cardelli, L., A spatial logic for concurrency (part I), Information and Computation 186 (2) (2003) 194–235.
Campbell Jr., M.; Hoane, A.J.; Hsu, F., Deep blue, Artificial Intelligence 134 (1–2) (2002) 57–83.
Cantone, D.; Cinotti, G., QuickHeapsort, an efficient mix of classical sorting algorithms, Theoretical Computer Science 285 (1) (2002) 25–42.
Carlsson, S., The deap—A double-ended heap to implement double-ended priority queues, Information Processing Letters 26 (1987) 33–36.
Carrillo, H.; Lipman, D., The multiple sequence alignment problem in biology, SIAM Journal of Applied Mathematics 5 (48) (1988) 1073–1082.
Chakrabarti, P.P.; Ghose, S.; Acharya, A.; DeSarkar, S.C., Heuristic search in restricted memory, Artificial Intelligence 41 (2) (1989) 197–221.
Chakrabarti, S.; van den Berg, M.; Dom, B., Focused crawling: A new approach to topic-specific web resource discovery, Computer Networks 31 (1999) 1123–1640.
Charikar, M.; Indyk, P.; Panigrahy, R., New algorithms for subset query, partial match, orthogonal range searching, and related problems, In: ICALP (2002), pp. 451–462.
Cheeseman, P.; Kanefsky, B.; Taylor, W., Where the really hard problems are, In: IJCAI (2001), pp. 331–340.
Chen, Y.; Wah, B.W., Subgoal partitioning and resolution in planning, In: Proceedings of the International Planning Competition (2004).
Cherkassy, B.V.; Goldberg, A.V.; Ratzig, T., Shortest path algorithms: Theory and experimental evaluation, Mathematical Programming 73 (1997) 129–174.
Cherkassy, B.V.; Goldberg, A.V.; Silverstein, C., Buckets, heaps, list and monotone priority queues, In: SODA (1997), pp. 82–92.
Choset, H.; Burdick, J., Sensor based planning and nonsmooth analysis, In: ICRA (1994), pp. 3034–3041.
Choset, H.; Lynch, K.; Hutchinson, S.; Kantor, G.; Burgard, W.; Kavraki, L.; et al., Principles of Robot Motion. (2005) MIT Press .
Choueka, Y.; Fraenkel, A.S.; Klein, S.T.; Segal, E., Improved hierarchical bit-vector compression in document retrieval systems, ACM SIGIR (1986) 88–96.
Chu, S.C.; Chen, Y.T.; Ho, J.H., Timetable scheduling using particle swarm optimization, In: ICICIC, Vol. 3 (2006), pp. 324–327.
Cimatti, A.; Giunchiglia, E.; Giunchiglia, F.; Traverso, P., Planning via model checking: A decision procedure for AR, In: ECP (1997), pp. 130–142.
Clarke, E.M.; Grumberg, O.; Jha, S.; Lu, Y.; Veith, H., Counterexample-guided abstraction refinement, In: CAV (2001), pp. 154–169.
Clarke, E.M.; Grumberg, O.; Long, D.E., Model checking and abstraction, ACM Transactions on Programming Languages and Systems 16 (5) (1994) 1512–1542.
Cleaveland, R.; Iyer, P.; Yankelevich, D., Optimality in abstractions of model checking, In: Static Analysis Symposium (1995), pp. 51–53.
Clune, J., Heuristic evaluation functions for general game playing, In: AAAI (2007), pp. 1134–1139.
Coego, J.; Mandow, L.; Pérez de-la Cruz, J.-L., A new approach to iterative deepening multiobjective A*, In: AI*IA (2009), pp. 264–273.
Cohen, J.D., Recursive hashing functions for n-grams, ACM Transactions on Information Systems 15 (3) (1997) 291–320.
Coles, A.; Fox, M.; Long, D.; Smith, A., A hybrid relaxed planning GraphLP heuristic for numeric planning domains, In: ICAPS (2008), pp. 52–59.
Cook, S.A., The complexity of theorem-proving procedures, In: STOC (1971), pp. 151–158.
Cook, D.J.; Varnell, R.C., Adaptive parallel iterative deepening A*, Journal of Artificial Intelligence Research 9 (1998) 136–166.
Cooperman, G.; Finkelstein, L., New methods for using Cayley graphs in interconnection networks, Discrete Applied Mathematics 37/38 (1992) 95–118.
Cormen, T.H.; Leiserson, C.E.; Rivest, R.L., Introduction to Algorithms. (1990) MIT Press .
Corradini, A.; Montanari, U.; Rossi, F.; Ehrig, H.; Heckel, R.; Löwe, M., Algebraic approaches to graph transformation I: Basic concepts and double pushout approach, In: (Editor: Rozenberg, G.) Handbook of Graph Grammars and Computing by Graph Transformation, Vol. 1, chap. 3 (1997) Foundations. World Scientific.
Coulom, R., Efficient selectivity and backup operators in Monte-Carlo tree search, In: CG (2006), pp. 72–83.
Cox, I., Blanche—An experiment in guidance and navigation of an autonomous robot vehicle, SIAM Journal on Computing 26 (1) (1997) 110–137.
Culberson, J.C., Sokoban is PSPACE-complete, In: FUN (1998), pp. 65–76.
Culberson, J.C., On the futility of blind search: An algorithmic view of no free lunch, Evolutionary Computing 6 (2) (1998) 109–127.
Culberson, J.C.; Schaeffer, J., Pattern databases, Computational Intelligence 14 (4) (1998) 318–334.
Cushing, W.; Kambhampati, S.; Mausam, Weld, D.S., When is temporal planning really temporal? In: IJCAI (2007), pp. 1852–1859.
Dakin, R.J., A tree-search algorithm for mixed integer programming problems, The Computer Journal 8 (1965) 250–255.
Dantsin, E.; Goerdt, A.; Hirsch, E.A.; Schöning, U., Deterministic k-SAT algorithms based on covering codes and local search, In: ICALP (2000), pp. 236–247.
Davidson, A., A fast pruning algorithm for optimal sequence alignment, In: Symposium on Bioinformatics and Bioengineering (2001), pp. 49–56.
Davis, H.W., Cost-error relationship in A*, Journal of the ACM 37 (2) (1990) 195–199.
Dayhoff, M.O.; Schwartz, R.M.; Orcutt, B.C., A model of evolutionary change in proteins, Atlas of Protein Sequences and Structures 5 (1978).
Dean, T.L.; Boddy, M., An analysis of time-dependent planning, In: AAAI (1988).
Dean, T.L.; Kaelbling, L.; Kirman, J.; Nicholson, A., Planning under time constraints in stochastic domains, Artificial Intelligence 76 (1–2) (1995) 35–74.
Dearden, R., Structured prioritised sweeping, In: ICML (2001), pp. 82–89.
DeChampeaux, D.; Sint, H.J., An improved bi-directional heuristic search algorithm, Journal of the ACM 24 (2) (1977) 177–191.
Dechter, R., Bucket elimination: A unifying framework for reasoning, Artificial Intelligence (1999) 41–85.
Dechter, R., Constraint Processing. (2004) Morgan Kaufmann .
Dechter, R.; Pearl, J., The optimality of A* revisited, In: AAAI (1983), pp. 59–99.
DeGiacomo, G.; Vardi, M.Y., Automata-theoretic approach to planning for temporally extended goals, In: ECP (1999), pp. 226–238.
Delort, C.; Spanjaard, O., Using bound sets in multiobjective optimization: Application to the biobjective binary knapsack problem, In: SEA (2010), pp. 253–265.
Demaine, E.D.; Demaine, M.L.; O'Rourke, J., PushPush and Push-1 are NP-hard in 2D, In: Canadian Conference on Computational Geometry (2000), pp. 211–219.
Dementiev, R.; Kettner, L.; Mehnert, J.; Sanders, P., Engineering a sorted list data structure for 32-bit key, In: ALENEX/ANALC (2004), pp. 142–151.
Dementiev, R.; Kettner, L.; Sanders, P., STXXL: Standard template library for XXL data sets, In: ESA (2005), pp. 640–651.
Demmer, M.J.; Herlihy, M., The arrow distributed directory protocol, In: DISC (1998), pp. 119–133.
Deng, X.; Kameda, T.; Papadimitriou, C., How to learn an unknown environment I: The rectilinear case, Journal of the ACM 45 (2) (1998) 215–245.
Deng, X.; Papadimitriou, C., Exploring an unknown graph, In: FOCS (1990), pp. 355–361.
Deo, N.; Pang, C., Shortest path algorithms: Taxonomy and annotations, IEEE Transactions on Systems Science and Cybernetics 14 (1984) 257–323.
Dial, R.B., Shortest-path forest with topological ordering, Communications of the ACM 12 (11) (1969) 632–633.
Dietterich, T.G., Hierarchical reinforcement learning with the maxq value function decomposition, Journal of Artificial Intelligence Research 13 (2000) 227–303.
Dietzfelbinger, M.; Karlin, A.; Mehlhorn, K.; Meyer auf der Heide, F.; Rohnert, H.; Tarjan, R.E., Dynamic perfect hashing: Upper and lower bounds, SIAM Journal of Computing 23 (1994) 738–761.
Dijkstra, E.W., A note on two problems in connexion with graphs, Numerische Mathematik 1 (1959) 269–271.
Dijkstra, E.W.; Scholten, C.S., Termination detection for diffusing computations, Information Processing Letters 11 (1) (1979) 1–4.
Diligenty, M.; Coetzee, F.; Lawrence, S.; Giles, C.M.; Gori, M., Focused crawling using context graphs, In: International Conference on Very Large Databases (2000), pp. 527–534.
Dillenburg, J.F.; Nelson, P.C., Perimeter search, Artificial Intelligence 65 (1) (1994) 165–178.
Dinh, H.T.; Russell, A.; Su, Y., On the value of good advice: The complexity of A* search with accurate heuristics, In: AAAI (2007), pp. 1140–1145.
Doran, J.; Michie, D., Experiments with the graph traverser program, In: Proceedings of the Royal Society of London, Vol. 294 (1966), pp. 235–259.
In: (Editors: Dorigo, M.; Gambardella, L.M.; Middendorf, M.; Stützle, T.) IEEE Transactions on Evolutionary Computation: Special Issue on Ant Algorithms and Swarm Intelligence (2002).
Dorigo, M.; Maniezzo, V.; Colorni, A., The ant system: Optimization by a colony of cooperating agents, IEEE Transactions on Systems, Man and Cybernetics 26 (1) (1996) 29–41.
In: (Editors: Dorigo, M.; Stützle, T.) Ant Colony Optimization (2004) MIT Press.
Dow, P.A.; Korf, R.E., Best-first search for treewidth, In: AAAI (2007), pp. 1146–1151.
Dräger, K.; Finkbeiner, B.; Podelski, A., Directed model checking with distance-preserving abstractions, International Journal on Software Tools for Technology Transfer 11 (1) (2009) 27–37.
Driscoll, J.R.; Gabow, H.N.; Shrairman, R.; Tarjan, R.E., Relaxed heaps: An alternative to fibonacci heaps with applications to parallel computation, Communications of the ACM 31 (11) (1988).
Droste, S.; Jansen, T.; Wegener, I., Possibly not a free lunch but at least a free appetizer, In: GECCO (1999), pp. 833–839.
Droste, S.; Jansen, T.; Wegener, I., Optimization with randomized search heuristics—The (A)NFL theorem, realistic scenarios, and difficult functions, Theoretical Computer Science 287 (2002) 131–144.
Dudek, G.; Romanik, K.; Whitesides, S., Localizing a robot with minimum travel, In: SODA (1995), pp. 437–446.
Dudek, G.; Romanik, K.; Whitesides, S., Localizing a robot with minimum travel, Journal on Computing 27 (2) (1998) 583–604.
Duran, M.A.; Grossmann, I.E., An outer approximation algorithm for a class of mixed-integer nonlinear programs, Mathematical Programming 36 (1986) 306–307.
Dutt, S.; Mahapatra, N.R., Scalable load balancing strategies for parallel A* algorithms, Journal of Parallel and Distributed Computing 22 (3) (1994) 488–505.
Dutt, S.; Mahapatra, N.R., Scalable global and local hashing strategies for duplicate pruning in parallel A* graph search, IEEE Transactions on Parallel and Distributed Systems 8 (7) (1997) 738–756.
Dutton, R.D., Weak-heap sort, BIT 33 (1993) 372–381.
Eckerle, J.; Lais, T., Limits and possibilities of sequential hashing with supertrace. FORTE/PSTV. (1998) Kluwer .
Eckerle, J.; Ottmann, T.A., An efficient data structure for the bidirectional search, In: ECAI (1994), pp. 600–604.
Eckerle, J.; Schuierer, S., Efficient memory-limited graph search, In: KI (1995), pp. 101–112.
Edelkamp, S., Suffix tree automata in state space search, In: KI (1997), pp. 381–385.
Edelkamp, S., Updating shortest paths, In: ECAI (1998), pp. 655–659.
Edelkamp, S., Planning with pattern databases, In: ECP (2001), pp. 13–24.
Edelkamp, S., Prediction of regular search tree growth by spectral analysis, In: KI (2001), pp. 154–168.
Edelkamp, S., Symbolic pattern databases in heuristic search planning, In: AIPS (2002), pp. 274–293.
Edelkamp, S., Memory limitation in artificial intelligence, In: (Editors: Sanders, P.; Meyer, U.; Sibeyn, J.F.) Memory Hierarchies (2003), pp. 233–250.
Edelkamp, S., Promela planning, In: SPIN (2003), pp. 197–212.
Edelkamp, S., Taming numbers and durations in the model checking integrated planning system, Journal of Artificial Research 20 (2003) 195–238.
Edelkamp, S., Generalizing the relaxed planning heuristic to non-linear tasks, In: KI (2004), pp. 198–212.
Edelkamp, S., External symbolic heuristic search with pattern databases, In: ICAPS (2005), pp. 51–60.
Edelkamp, S., On the compilation of plan constraints and preferences, In: ICAPS (2006), pp. 374–377.
Edelkamp, S., Automated creation of pattern database search heuristics, In: MOCHART (2007), pp. 35–50.
Edelkamp, S.; Eckerle, J., New strategies in real-time heuristic search, In: (Editors: Koenig, S.; Blum, A.; Ishida, T.; Korf, R.E.) AAAI Workshop on Online Search (1997), pp. 30–35.
Edelkamp, S.; Helmert, M., The model checking integrated planning system MIPS, AI-Magazine (2001) 67–71.
Edelkamp, S.; Jabbar, S., Action planning for graph transition systems, In: ICAPS, Workshop on Verification and Validation of Model-Based Planning and Scheduling Systems (2005), pp. 58–66.
Edelkamp, S.; Jabbar, S., Action planning for directed model checking of Petri nets, ENTCS 149 (2) (2006) 3–18.
Edelkamp, S.; Jabbar, S., Externalizing real-time model checking, In: MOCHART (2006), pp. 67–83.
Edelkamp, S.; Jabbar, S., Large-scale directed model checking LTL, In: SPIN (2006), pp. 1–18.
Edelkamp, S.; Jabbar, S.; Bonet, B., External memory value iteration, In: ICAPS (2007), pp. 414–429.
Edelkamp, S.; Jabbar, S.; Lluch-Lafuente, A., Cost-algebraic heuristic search, In: AAAI (2005), pp. 1362–1367.
Edelkamp, S.; Jabbar, S.; Lluch-Lafuente, A., Heuristic search for the analysis of graph transition systems, In: ICGT (2006), pp. 414–429.
Edelkamp, S.; Jabbar, S.; Schrödl, S., External A*, In: KI (2004), pp. 233–250.
Edelkamp, S.; Jabbar, S.; Sulewski, D., Distributed verification of multi-threaded C++ programs, ENTCS 198 (1) (2008) 33–46.
Edelkamp, S.; Jabbar, S.; Willhalm, T., Geometric travel planning, In: ITSC, Vol. 2 (2003), pp. 964–969.
Edelkamp, S.; Kissmann, P., Externalizing the multiple sequence alignment problem with affine gap costs, In: KI (2007), pp. 444–447.
Edelkamp, S.; Kissmann, P., Symbolic classification of general multi-player games, In: ECAI (2008), pp. 905–906.
Edelkamp, S.; Kissmann, P., Symbolic classification of general two-player games, In: KI (2008), pp. 185–192.
Edelkamp, S.; Kissmann, P., Limits and possibilities of BDDs in state space search, In: AAAI (2008), pp. 1452–1453.
Edelkamp, S.; Kissmann, P.; Jabbar, S., Scaling search with symbolic pattern databases, In: MOCHART (2008), pp. 49–64.
Edelkamp, S.; Korf, R.E., The branching factor of regular search spaces, In: AAAI (1998), pp. 299–304.
Edelkamp, S.; Leue, S.; Lluch-Lafuente, A., Directed explicit-state model checking in the validation of communication protocols, International Journal on Software Tools for Technology Transfer 5 (2–3) (2004) 247–267.
Edelkamp, S.; Leue, S.; Lluch-Lafuente, A., Partial order reduction and trail improvement in directed model checking, International Journal on Software Tools for Technology Transfer 6 (4) (2004) 277–301.
Edelkamp, S.; Leven, P., Directed automated theorem proving, In: LPAR (2002), pp. 145–159.
Edelkamp, S.; Lluch-Lafuente, A., Abstraction in directed model checking, In: ICAPS, Workshop on Connecting Planning Theory with Practice (2004).
Edelkamp, S.; Meyer, U., Theory and practice of time-space trade-offs in memory limited search, In: KI (2001), pp. 169–184.
Edelkamp, S.; Reffel, F., OBDDs in heuristic search, In: KI (1998), pp. 81–92.
Edelkamp, S.; Sanders, P.; Simecek, P., Semi-external LTL model checking, In: CAV (2008), pp. 530–542.
Edelkamp, S.; Schrödl, S., Localizing A*, In: AAAI (2000), pp. 885–890.
Edelkamp, S.; Stiegeler, P., Implementing HEAPSORT with n lg n − 0.9n and QUICKSORT with n lg n + 0.2 n comparisons, ACM Journal of Experimental Algorithmics 7 (5) (2002).
Edelkamp, S.; Sulewski, D., Flash-efficient LTL model checking with minimal counterexamples, In: SEFM (2008), pp. 73–82.
Edelkamp, S.; Sulewski, D., Efficient probabilistic model checking on general purpose graphics processors, In: SPIN (2010), pp. 106–123.
Edelkamp, S.; Sulewski, D., GPU exploration of two-player games with perfect hash functions, In: SOCS (2010), pp. 23–30.
Edelkamp, S.; Sulewski, D.; Yücel, C., GPU exploration of two-player games with perfect hash functions, In: SOCS (2010), pp. 23–30.
Edelkamp, S.; Sulewski, D.; Yücel, C., Perfect hashing for state space exploration on the GPU, In: ICAPS (2010), pp. 57–64.
Edelkamp, S.; Sulewski, D.; Barnat, J.; Brim, L.; Simecek, P., Flash memory efficient LTL model checking, Science of Computer Programming 76 (2) (2011) 136–157.
Edelkamp, S.; Wegener, I., On the performance of WEAK-HEAPSORT, In: STACS (2000), pp. 254–266.
Elmasry, A., The violation heap: A relaxed fibonacci-like heap, In: COCOON (2010), pp. 479–488.
Elmasry, A.; Jensen, C.; Katajainen, J., Two new methods for constructing double-ended priority queues from priority queues, Computing 83 (4) (2008) 193–204.
Elmasry, J.; Jensen, C.; Katajainen, J., Multipartite priority queues, ACM Transactions on Algorithms 5 (1) (2008) 1–19.
Elmasry, A.; Jensen, C.; Katajainen, J., Two-tier relaxed heaps, Acta Informatica 45 (3) (2008) 193–210.
Engels, A.; Feijs, L.M.G.; Mauw, S., Test generation for intelligent networks using model checking, In: TACAS (1997), pp. 384–398.
Eppstein, D., On the NP-completeness of cryptarithms, SIGACT News 18 (3) (1987) 38–40.
Eppstein, D.; Galil, Z., Parallel algorithmic techniques for compinatorial computation, Annual Review of Computer Science 3 (1988) 233–283.
Even, S.; Gazit, H., Updating distances in dynamic graphs, Methods of Operations Research 49 (1985) 371–387.
Even, S.; Shiloach, Y., An on-line edge deletion problem, Journal of the ACM 28 (1) (1981) 1–4.
Evett, M.; Hendler, J.; Mahanti, A.; Nau, D.S., PRA*: A memory-limited heuristic search procedure for the connection machine, In: Frontiers in Massive Parallel Computation (1990), pp. 145–149.
Eyerich, P.; Keller, T.; Helmert, M., High-quality policies for the Canadian traveler's problem, In: AAAI (2010), pp. 51–58.
Eyerich, P.; Mattmüller, R.; Röger, G., Using the context-enhanced additive heuristic for temporal and numeric planning, In: ICAPS (2009), pp. 130–137.
Fabiani, P.; Meiller, Y., Planning with tokens: An approach between satisfaction and optimisation, In: PUK (2000).
Fadel, R.; Jakobsen, K.V.; Katajainen, J.; Teuhola, J., External heaps combined with effective buffering, In: Australasian Theory Symposium (1997), pp. 72–78.
Faigle, U.; Kern, W., Some convergence results for probabilistic tabu search, Journal of Computing 4 (1992) 32–37.
Feige, U., A fast randomized LOGSPACE algorithm for graph connectivity, Theoretical Computer Science 169 (2) (1996) 147–160.
Feige, U., A spectrum of time-space tradeoffs for undirected s – t connectivity, Journal of Computer and System Sciences 54 (2) (1997) 305–316.
Felner, A.; Alder, A., Solving the 24 puzzle with instance dependent pattern databases, In: SARA (2005), pp. 248–260.
Felner, N.R.; Korf, R.E.; Hanan, S., Additive pattern database heuristics, Journal of Artificial Intelligence Research 22 (2004) 279–318.
Felner, A.; Meshulam, R.; Holte, R.C.; Korf, R.E., Compressing pattern databases, In: AAAI (2004), pp. 638–643.
Felner, A.; Moldenhauer, C.; Sturtevant, N.R.; Schaeffer, J., Single-frontier bidirectional search, In: AAAI (2010).
Felner, A.; Ofek, N., Combining perimeter search and pattern database abstractions, In: SARA (2007), pp. 414–429.
Felner, A.; Sturtevant, N.R., Abstraction-based heuristics with true distance computations, In: SARA (2009).
Felner, A.; Shoshani, Y.; Altshuler, Y.; Bruckstein, A., Multi-agent physical A* with large pheromones, Autonomous Agents and Multi-Agent Systems 12 (1) (2006) 3–34.
Felner, A.; Zahavi, U.; Schaeffer, J.; Holte, R.C., Dual lookups in pattern databases, In: IJCAI (2005), pp. 103–108.
Feng, Z.; Hansen, E.A., Symbolic heuristic search for factored Markov decision processes, In: AAAI (2002), pp. 714–719.
Feuerstein, E.; Marchetti-Spaccamela, A., Dynamic algorithms for shortest paths in planar graphs, Theoretical Computer Science 116 (2) (1993) 359–371.
Fikes, R.E.; Nilsson, N.J., Strips: A new approach to the application of theorem proving to problem solving, Artificial Intelligence 2 (1971) 189–208.
Finnsson, H.; Björnsson, Y., Simulation-based approach to general game playing, In: AAAI (2008), pp. 1134–1139.
Fleischer, R.; Romanik, K.; Schuierer, S.; Trippen, G., Optimal robot localization in trees, Information and Computation 171 (2001) 224–247.
Forbus, K.D.; de Kleer, J., Building Problem Solvers. (1993) MIT Press .
Ford, L.R.; Fulkerson, D.R., Flows in Networks. (1962) Princeton University Press .
Forgy, C.L., Rete: A fast algorithm for the many pattern/many object pattern match problem, Artificial Intelligence 19 (1982) 17–37.
Fotakis, D.; Pagh, R.; Sanders, P., Space efficient hash tables with worst case constant access time, In: STACS (2003), pp. 271–282.
Foux, G.; Heymann, M.; Bruckstein, A., Two-dimensional robot navigation among unknown stationary polygonal obstacles, IEEE Transactions on Robotics and Automation 9 (1) (1993) 96–102.
Fox, D.; Burgard, W.; Thrun, S., Active Markov localization for mobile robots, Robotics and Autonomous Systems 25 (1998) 195–207.
Fox, M.; Long, D., The detection and exploration of symmetry in planning problems, In: IJCAI (1999), pp. 956–961.
Fox, M.; Long, D., PDDL2.1: An extension to PDDL for expressing temporal planning domains, Journal of Artificial Intelligence Research 20 (2003) 61–124.
Fox, M.; Long, D.; Halsey, K., An investigation on the expressive power of PDDL2.1, In: ECAI (2004), pp. 586–590.
Franceschini, G.; Geffert, V., An in-place sorting with o(n lg n) comparisons and o(n) moves, In: FOCS (2003), pp. 242–250.
Franciosa, P.; Frigioni, D.; Giaccio, R., Semi-dynamic breadth-first search in digraphs, Theoretical Computer Science 250 (1–2) (2001) 201–217.
Frank, I.; Basin, D., Search in games with incomplete information: A case study using bridge card play, Artificial Intelligence 100 (1998) 87–123.
Fredman, M.L.; Tarjan, R.E., Fibonacci heaps and their uses in improved network optimization algorithm, Journal of the ACM 34 (3) (1987) 596–615.
Fredman, M.L.; Komlós, J.; Szemerédi, E., Storing a sparse table with o(1) worst case access time, Journal of the ACM 3 (1984) 538–544.
Fredman, M.L.; Sedgewick, R.; Sleator, D.D.; Tarjan, R.E., The pairing heap: A new form of self-adjusting heap, Algorithmica 1 (1) (1986) 111–129.
Fredriksson, K.; Navarro, G.; Ukkonen, E., Sequential and indexed two-dimensional combinatorial template matching allowing rotations, Theoretical Computer Science 347 (1–2) (2005) 239–275.
Frigioni, D.; Marchetti-Spaccamela, A.; Nanni, U., Fully dynamic output bounded single source shortest path problem, In: SODA (1996), pp. 212–221.
Frigioni, D.; Marchetti-Spaccamela, A.; Nanni, U., Semidynamic algorithms for maintaining single source shortest path trees, Algorithmica 22 (3) (1998) 250–274.
Frigioni, D.; Marchetti-Spaccamela, A.; Nanni, U., Fully dynamic algorithms for maintaining shortest paths trees, Journal of Algorithms 34 (2) (2000) 251–281.
Fuentetaja, R.; Borrajo, D.; Linares López, C., A new approach to heuristic estimations for cost-based planning, In: FLAIRS (2008), pp. 543–548.
Furcy, D.; Felner, A.; Holte, R.C.; Meshulam, R.; Newton, J., Multiple pattern databases, In: ICAPS (2004), pp. 122–131.
Furcy, D.; Koenig, S., Speeding up the convergence of real-time search, In: AAAI (2000), pp. 891–897.
Furtak, T.; Kiyomi, M.; Uno, T.; Buro, M., Generalized Amazons is PSPACE-complete, In: IJCAI (2005), pp. 132–137.
Gabow, H.N.; Tarjan, R.E., Faster scaling algorithms for network problems, SIAM Society for Industrial and Applied Mathematics 18 (5) (1989) 1013–1036.
Galand, L.; Perny, P.; Spanjaard, O., Choquet-based optimisation in multiobjective shortest path and spanning tree problems, European Journal of Operational Research 204 (2) (2010) 303–315.
Gambardella, L.M.; Dorigo, M., Solving symmetric and asymmetric tsps by ant colonies, In: Conference on Evolutionary Computation (IEEE-EC) (1996), pp. 20–22.
Garavel, H.; Mateescu, R.; Smarandache, I., Parallel state space construction for model-checking, In: SPIN (2001), pp. 216–234.
Gardner, M., The problems of Mrs. Perkin's quilt and other square packing problems, Scientific American 215 (3) (1966) 59–70.
Garey, M.R.; Johnson, D.S., Computers and Intractibility: A Guide to the Theory of NP-Completeness. (1979) Freeman Company .
Garey, M.R.; Johnson, D.S.; Stockmeyer, L., Some simplified NP-complete problems, In: STOC (1974), pp. 47–63.
Gaschnig, J., A problem similarity approach to devising heuristics: First results, In: IJCAI (1979), pp. 434–441.
Gates, W.H.; Papadimitriou, C.H., Bounds for sorting by prefix reversal, Discrete Math. 27 (1976) 47–57.
Geffner, H., Functional Strips: A More Flexible Language for Planning and Problem Solving. (2000) Kluver ; (pp. 188–209).
Geisberger, R.; Schieferdecker, D., Heuristic contraction hierarchies with approximation guarantee, In: SOCS (2010), pp. 31–38.
Geldenhuys, J.; Valmari, A., A nearly memory optimal data structure for sets and mappings, In: SPIN (2003); (pp. 236–150).
Gelly, S.; Silver, D., Combining online and offline knowledge in UCT, In: ICML, Vol. 227 (2007), pp. 273–280.
Genesereth, M.; Nourbakhsh, I., Time-saving tips for problem solving with incomplete information, In: AAAI (1993), pp. 724–730.
Geoffrion, A.M., Generalized Benders decomposition, Journal of Optimization Theory and Applications 10 (4) (1972) 237–241.
Gerevini, A.; Saetti, A.; Serina, I., An approach to temporal planning and scheduling in domains with predictable exogenous events, Journal of Artificial Intelligence Research 25 (2006) 187–231.
Ghiani, G.; Guerriero, F.; Laporte, G.; Musmanno, R., Real-time vehicle routing: Solution concepts, algorithms and parallel computing strategies, European Journal of Operational Research 151 (2003) 1–11.
Ghosh, S.; Mahanti, A.; Nau, D.S., ITS: An efficient limited-memory heuristic tree search algorithm, In: AAAI (1994), pp. 1353–1358.
Ginsberg, M.L., Knowledge-base reduction: A new approach to checking knowledge bases for inconsistency and redundancy, In: AAAI (1988), pp. 585–589.
Ginsberg, M.L., Dynamic backtracking, Journal of Artificial Intelligence Research 1 (1993) 25–46.
Ginsberg, M.L., Partition search, In: AAAI (1996), pp. 228–233.
Ginsberg, M.L., Step toward an expert-level bridge-playing program, In: IJCAI (1999), pp. 584–589.
Ginsberg, M.L.; Harvey, W., Iterative broadening, Artificial Intelligence 55 (1992) 367–383.
Godefroid, P., Using partial orders to improve automatic verification methods, In: CAV (1991), pp. 176–185.
Godefroid, P.; Khurshid, S., Exploring very large state spaces using genetic algorithms, International Journal on Software Tools for Technology Transfer 6 (2) (2004) 117–127.
Goetsch, G.; Campbell, M.S., Experiments with the null-move heuristic, In: Computers, Chess, and Cognition (1990), pp. 159–181.
Gooley, M.M.; Wah, B.W., Speculative search: An efficient search algorithm for limited memory, In: IEEE International Workshop on Tools with Artificial Intelligence (1990), pp. 194–200.
Gordon, M., HOL: A proof generating system for higher-order logic, In: (Editors: Birtwistle, G.; Subrahmanyam, P.A.) VLSI Specification, Verification, and Synthesis (1987) Kluwer.
Goto, S.; Sangiovanni-Vincentelli, A., A new shortest path updating algorithm, Networks 8 (4) (1978) 341–372.
Govindaraju, N.K.; Gray, J.; Kumar, R.; Manocha, D., GPUTeraSort: High performance graphics coprocessor sorting for large database management, In: SIGMOD (2006), pp. 325–336.
Graf, S.; Saidi, H., Construction of abstract state graphs with PVS, In: CAV (1997), pp. 72–83.
Groce, A.; Visser, W., Model checking Java programs using structural heuristics, In: ISSTA (2002), pp. 12–21.
Grumberg, O.; Heyman, T.; Schuster, A., A work-efficient distributed algorithm for reachability analysis, Formal Methods in System Design 29 (2) (2006) 157–175.
Guibas, L.; Motwani, R.; Raghavan, P., The robot localization problem in two dimensions, In: SODA (1992), pp. 259–268.
Guida, G.; Somalvico, M., A method for computing heuristics in problem solving, Information and Computation 19 (1979) 251–259.
Günther, M.; Nissen, V., Particle swarm optimization and an agent-based algorithm for a problem of staff scheduling, In: EvoApplications (2010), pp. 451–461; (2).
Gupta, S.; Kececioglu, J.; Schaffer, A., Improving the practical space and time efficiency of the shortest-paths approach to sum-of-pairs multiple sequence alignment, Journal of Computational Biology (1996).
Gusfield, D., Efficient methods for multiple sequence alignment with guaranteed error bounds, Bulletin of Mathematical Biology 55 (1) (1993) 141–154.
Gusfield, D., Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology. (1997) Cambridge University Press .
Gutmann, J.; Fukuchi, M.; Fujita, M., Real-time path planning for humanoid robot navigation, In: IJCAI (2005), pp. 1232–1237.
Hachtel, G.D.; Somenzi, F., A symbolic algorithm for maximum network flow, Methods in System Design 10 (1992) 207–219.
Hajek, J., Automatically verified data transfer protocols, In: International Computer Communications Conference (1978), pp. 749–756.
Han, C.; Lee, C., Comments on Mohr and Henderson's path consistency algorithm, Artificial Intelligence 36 (1988) 125–130.
Hansen, E.A.; Zhou, R.; Feng, Z., Symbolic heuristic search using decision diagrams, In: SARA (2002), pp. 83–98.
Hansen, E.A.; Zilberstein, S., Heuristic search in cyclic AND/OR graphs, In: AAAI (1998), pp. 412–418.
Hansen, E.A.; Zilberstein, S., LAO*: A heuristic search algorithm that finds solutions with loops, Artificial Intelligence 129 (2001) 35–62.
Hansson, O.; Mayer, A.; Valtorta, M., A new result on the complexity of heuristic estimates for the A* algorithm (research note), Artificial Intelligence 55 (1992) 129–143.
Haralick, R.M.; Elliot, G.L., Increasing tree search efficiency for constraint satisfaction problems, Artificial Intelligence 14 (1980) 263–314.
Harris, M.; Sengupta, S.; Owens, J.D., Parallel prefix sum (scan) with CUDA, In: (Editor: Nguyen, H.) GPU Gems, 3 (2007) Addison-Wesley, pp. 851–876.
Hart, P.E.; Nilsson, N.J.; Raphael, B., A formal basis for heuristic determination of minimum path cost, IEEE Transactions on on Systems Science and Cybernetics 4 (1968) 100–107.
Harvey, W.D.; Ginsberg, M.L., Limited discrepancy search, In: IJCAI (1995), pp. 607–613.
Haslum, P., Improving heuristics through relaxed search—An analysis of TP4 and HSP* a in the 2004 planning competition, Journal of Artificial Intelligence Research 25 (2006) 233–267.
Haslum, P., hm(p) = h1(pm): Alternative characterisations of the generalisation from hmax to hm, In: ICAPS (2009).
Haslum, P.; Bonet, B.; Geffner, H., New admissible heuristics for domain-independent planning, In: AAAI (2005), pp. 1163–1168.
Haslum, P.; Botea, A.; Helmert, M.; Bonet, B.; Koenig, S., Domain-independent construction of pattern database heuristics for cost-optimal planning, In: AAAI (2007), pp. 1007–1012.
Haslum, P.; Geffner, H., Admissible heuristics for optimal planning, In: AIPS (2000), pp. 140–149.
Haslum, P.; Jonsson, P., Planning with reduced operator sets, In: AIPS (2000), pp. 150–158.
Haverkort, B.R.; Bell, A.; Bohnenkamp, H.C., On the efficient sequential and distributed generation of very large Markov chains from stochastic Petri nets, In: Workshop on Petri Net and Performance Models (1999) IEEE Computer Society Press, pp. 12–21.
Hawes, N., An anytime planning agent for computer game worlds, In: CG, Workshop on Agents in Computer Games (2002).
Hebert, M.; McLachlan, R.; Chang, P., Experiments with driving modes for urban robots, In: Proceedings of the SPIE Mobile Robots (1999).
Heinz, E.A., Scalable Search in Computer Chess. (2000) Vierweg .
Heinz, A.; Hense, C., Bootstrap learning of alpha-beta-evaluation functions, In: ICCI (1993), pp. 365–369.
Helmert, M., Decidability and undecidability results for planning with numerical state variables, In: AIPS (2002), pp. 303–312.
Helmert, M., Complexity results for standard benchmark domains in planning, Artificial Intelligence 143 (2) (2003) 219–262.
Helmert, M., New complexity results for classical planning benchmarks, In: ICAPS (2006), pp. 52–62.
Helmert, M., The Fast Downward planning system, Journal of Artificial Intelligence Research 26 (2006) 191–246.
Helmert, M.; Domshlak, C., Landmarks, critical paths and abstractions: What's the difference anyway? In: ICAPS (2009), pp. 162–169.
Helmert, M.; Geffner, H., Unifying the causal graph and additive heuristics, In: ICAPS (2008), pp. 140–147.
Helmert, M.; Haslum, P.; Hoffmann, J., Flexible abstraction heuristics for optimal sequential planning, In: ICAPS (2007), pp. 176–183.
Helmert, M.; Mattmüller, R.; Röger, G., Approximation properties of planning benchmarks, In: ECAI (2006), pp. 585–589.
Helmert, M.; Röger, G., How good is almost perfect? In: AAAI (2008), pp. 944–949.
Helmert, M.; Röger, G., Relative-order abstractions for the pancake problem, In: ECAI (2010), pp. 745–750.
Henrich, D.; Wurll, Ch.; Wörn, H., Multi-directional search with goal switching for robot path planning, In: IEA/AIE (1998), pp. 75–84.
Henzinger, T.A.; Kopke, P.W.; Puri, A.; Varaiya, P., What's decidable about hybrid automata? In: STOC (1995), pp. 373–381.
Hernádvölgyi, I.T., Using pattern databases to find macro operators, In: AAAI (2000), p. 1075.
Hernández, C.; Meseguer, P., LRTA* (k), In: IJCAI (2005), pp. 1238–1243.
Hernández, C.; Meseguer, P., Improving HLRTA* (k), In: CAEPIA (2007), pp. 110–119.
Hernández, C.; Meseguer, P., Improving LRTA* (k), In: IJCAI (2007), pp. 2312–2317.
Hickmott, S.; Rintanen, J.; Thiebaux, S.; White, L., Planning via Petri net unfolding, In: IJCAI (2006), pp. 1904–1911.
Hirschberg, D.S., A linear space algorithm for computing common subsequences, Communications of the ACM 18 (6) (1975) 341–343.
Hoey, J.; St-Aubin, R.; Hu, A.; Boutilier, C., SPUDD: Stochastic planning using decision diagrams, In: UAI (1999), pp. 279–288.
Hoffman, F.; Icking, C.; Klein, R.; Kriegel, K., A competitive strategy for learning a polygon, In: SODA (1997), pp. 166–174.
Hoffmann, J., Local search topology in planning benchmarks: An empirical analysis, In: IJCAI (2001), pp. 453–458.
Hoffmann, J., The Metric FF planning system: Translating “ignoring the delete list” to numerical state variables, Journal of Artificial Intelligence Research 20 (2003) 291–341.
Hoffmann, J.; Edelkamp, S., The deterministic part of IPC-4: An overview, Journal of Artificial Intelligence Research 24 (2005) 519–579.
Hoffmann, J.; Edelkamp, S.; Thiebaux, S.; Englert, R.; Liporace, F.; Trüg, S., Engineering realistic benchmarks for planning: The domains used in the deterministic part of IPC-4, Journal of Artificial Intelligence Research (2006); Submitted.
Hoffmann, J.; Koehler, J., A new method to query and index sets, In: IJCAI (1999), pp. 462–467.
Hoffmann, J.; Nebel, B., Fast plan generation through heuristic search, Journal of Artificial Intelligence Research 14 (2001) 253–302.
Hoffmann, J.; Porteous, J.; Sebastia, L., Ordered landmarks in planning, Journal of Artificial Intelligence Research 22 (2004) 215–278.
Hofmeister, T., An approximation algorithm MAX2SAT with cardinality constraints, In: ESA (2003), pp. 301–312.
Hofmeister, T.; Schöning, U.; Schuler, R.; Watanabe, O., A probabilistic 3-SAT algorithm further improved, In: STACS (2002), pp. 192–202.
Holmberg, K., On the convergence of the cross decomposition, Mathematical Programming 47 (1990) 269–316.
Holte, R.C., Common misconceptions concerning heuristic search, In: SOCS (2009), pp. 46–51.
Holte, R.C.; Hernádvölgyi, I.T., A space-time tradeoff for memory-based heuristics, In: AAAI (1999), pp. 704–709.
Holte, R.C.; Grajkowski, J.; Tanner, B., Hierarchical heuristic search revisited, In: SARA (2005), pp. 121–133.
Holte, R.C.; Perez, M.B.; Zimmer, R.M.; Donald, A.J., Hierarchical A*: Searching abstraction hierarchies, In: AAAI (1996), pp. 530–535.
Holzmann, G.J., State compression in SPIN, In: 3rd Workshop on Software Model Checking (1997).
Holzmann, G.J., An analysis of bitstate hashing, Formal Methods in System Design 13 (3) (1998) 287–305.
Holzmann, G.J., The Spin Model Checker: Primer and Reference Manual. (2004) Addison-Wesley .
Holzmann, G.J.; Bosnacki, D., The design of a multicore extension of the SPIN model checker, IEEE Transactions on Software Engineering 33 (10) (2007) 659–674.
Holzmann, G.J.; Puri, A., A minimized automaton representation of reachable states, International Journal on Software Tools for Technology Transfer 2 (3) (1999) 270–278.
Hoos, H.; Stützle, T., Towards a characterisation of the behaviour of stochastic local search algorithms for SAT, Artificial Intelligence 112 (1999) 213–232.
Hoos, H.H.; Stützle, T., Stochastic Local Search: Foundations Applications. (2004) Morgan Kaufmann .
Hopcroft, J.E.; Ullman, J.D., Introduction to Automata Theory, Languages and Computation. (1979) Addison-Wesley .
Horowitz, E.; Sahni, S., Computing partitions with applications to the knapsack problem, Journal of the ACM 21 (2) (1974) 277–292.
Hsu, E.; McIlraith, S., Computing equivalent transformations for applying branch-and-bound search to MAX-SAT, In: SOCS (2010), pp. 111–118.
Hüffner, F.; Edelkamp, S.; Fernau, H.; Niedermeier, R., Finding optimal solutions to Atomix, In: KI (2001), pp. 229–243.
Huyn, N.; Dechter, R.; Pearl, J., Probabilistic analysis of the complexity of A*, Artificial Intelligence 15 (1980) 241–254.
Ibaraki, T., m-depth serach in branch-and-bound algorithms, Computer and Information Sciences 7 (4) (1978) 315–373.
Ibaraki, T., Generalization of alpha-beta and SSS* search procedures, Artificial Intelligence 29 (1986) 73–117.
Icking, C.; Klein, R.; Langetepe, E., An optimal competitive strategy for walking in streets, In: STACS (1999), pp. 110–120.
Ikeda, T.; Imai, T., A fast A* algorithm for multiple sequence alignment, Genome Informatics Workshop (1994) 90–99.
Inggs, C.; Barringer, H., CTL* model checking on a shared memory architecture, Formal Methods in System Design 29 (2) (2006) 135–155.
Ishida, T., Moving target search with intelligence, In: AAAI (1992), pp. 525–532.
Ishida, T., Real-Time Search for Learning Autonomous Agents. (1997) Kluwer Academic Publishers .
Italiano, G., Finding paths and deleting edges in directed acyclic graphs, Information Processing Letters 28 (1) (1988) 5–11.
Jabbar, S.; Edelkamp, S., I/O efficient directed model checking, In: VMCAI (2005), pp. 313–329.
Jabbar, S.; Edelkamp, S., Parallel external directed model checking with linear I/O, In: VMCAI (2006), pp. 237–251.
Jabbari, S.; Zilles, S.; Holte, R.C., Bootstrap learning of heuristic functions, In: SOCS (2010), pp. 52–60.
Jájá, J., An Introduction to Parallel Algorithms. (1992) Addision Wesley .
Jaychandran, G.; Vishal, V.; Pande, V.S., Using massively parallel simulations and Markovian models to study protein folding: Examining the Villin head-piece, Journal of Chemical Physics 124 (6) (2006) 164903–164914.
Jensen, R.M.; Bryant, R.E.; Veloso, M.M., Set A*: An efficient BDD-based heuristic search algorithm, In: AAAI (2002), pp. 668–673.
Jensen, R.M.; Hansen, E.A.; Richards, S.; Zhou, R., Memory-efficient symbolic heuristic search, In: ICAPS (2006), pp. 304–313.
Johnson, D.S., Efficient algorithms for shortest paths in sparse networks, Journal of the ACM 24 (1) (1977) 1–13.
Jones, D.T.; Taylor, W.R.; Thornton, J.M., The rapid generation of mutation data matrices from protein sequences, CABIOS 3 (1992) 275–282.
Junghanns, A.; Schaeffer, J., Single agent search in the presence of deadlocks, In: AAAI (1998), pp. 419–424.
Junghanns, A.; Schaeffer, J., Sokoban: Improving the search with relevance cuts, Theoretical Computing Science 252 (1–2) (2001) 151–175.
Kabanza, F.; Thiebaux, S., Search control in planing for termporally extended goals, In: ICAPS (2005), pp. 130–139.
Kaindl, H.; Kainz, G., Bidirectional heuristic search reconsidered, Journal of Artificial Intelligence Research 7 (1997) 283–317.
Kaindl, H.; Khorsand, A., Memory-bounded bidirectional search, In: AAAI (1994), pp. 1359–1364.
Kale, L.; Saletore, V.A., Parallel state-space search for a first solution with consistent linear speedups, International Journal of Parallel Programming 19 (4) (1990) 251–293.
Kaplan, H.; Shafrir, N.; Tarjan, R.E., Meldable heaps and boolean union-find, In: STOC (2002), pp. 573–582.
Karp, R.M.; Rabin, M.O., Efficient randomized pattern-matching algorithms, IBM Journal of Research and Development 31 (2) (1987) 249–260.
Kask, K.; Dechter, R., Branch and bound with mini-bucket heuristics, In: IJCAI (1999), pp. 426–435.
Katajainen, J.; Vitale, F., Navigation piles with applications to sorting, priority queues, and priority deques, Nordic Journal of Computing 10 (3) (2003) 238–262.
Katz, M.; Domshlak, C., Structural-pattern databases, In: ICAPS (2009), pp. 186–193.
Kautz, H.; Selman, B., Pushing the envelope: Planning propositional logic, and stochastic search, In: ECAI (1996), pp. 1194–1201.
Kavraki, L.; Svestka, P.; Latombe, J.-C.; Overmars, M., Probabilistic roadmaps for path planning in high-dimensional configuration spaces, IEEE Transactions on Robotics and Automation 12 (4) (1996) 566–580.
Keller, T.; Kupferschmid, S., Automatic bidding for the game of Skat, In: KI (2008), pp. 95–102.
Kennedy, J.; Eberhart, R.C.; Shi, Y., Swarm Intelligence. (2001) Morgan Kaufmann .
Kerjean, S.; Kabanza, F.; St-Denis, R.; Thiebaux, S., Analyzing LTL model checking techniques for plan synthesis and controller synthesis, In: MOCHART (2005).
Kilby, P.; Slaney, J.; Thiebaux, S.; Walsh, T., Backbones and backdoors in satisfiability, In: AAAI (2005), pp. 1368–1373.
Kirkpatrick, S.; Gelatt Jr., C.D.; Vecchi, M.P., Optimization by simulated annealing, Science 220 (1983) 671–680.
Kishimoto, A.; Fukunaga, A.S.; Botea, A., Scalable, parallel best-first search for optimal sequential planning, In: ICAPS (2009), pp. 201–208.
Kissmann, P.; Edelkamp, S., Instantiating general games using Prolog or dependency graphs, In: KI (2010), pp. 255–262.
Kissmann, P.; Edelkamp, S., Layer-abstraction for symbolically solving general two-player games, In: SOCS (2010).
Kleer, J.; Williams, B.C., Diagnosing multiple faults, Artificial Intelligence (1987); (pp. 1340–1330).
Klein, D.; Manning, C., A* parsing: Fast exact Viterbi parse selection, In: North American chapter of the association for computational linguistics (2003), pp. 40–47.
Klein, P.; Subramanian, S., Fully dynamic approximation schemes for shortest path problems in planar graphs, In: WADS (1993), pp. 443–451.
Kleinberg, J., localization problem for mobile robots, In: Proceedings of the Symposium on Foundations of Computer Science (1994), pp. 521–533.
Knight, K., Are many reactive agents better than a few deliberative ones? In: IJCAI (1993), pp. 432–437.
Knoblock, C.A., Automatically generating abstractions for planning, Artificial Intelligence 68 (2) (1994) 243–302.
Knuth, D.E.; Morris, J.H.; Prat, V.R., Fast pattern matching in strings, Journal of Computing 6 (1) (1977) 323–350.
Knuth, D.E.; Plass, M.F., Breaking paragraphs into lines, Software—Practice and Experience 11 (1981) 1119–1184.
Kobayashi, H.; Imai, H., Improvement of the A* algorithm for multiple sequence alignment, Genome Informatics (1998) 120–130.
Kocsis, L.; Szepesvári, C., Bandit based Monte-Carlo planning, In: ICML (2006), pp. 282–293.
Koenig, S., Minimax real-time heuristic search, Artificial Intelligence 129 (1–2) (2001) 165–197.
Koenig, S., Agent-centered search, AI Magazine 22 (4) (2001) 109–131.
Koenig, S., A comparison of fast search methods for real-time situated agents, In: AAMAS (2004), pp. 864–871.
Koenig, S.; Likhachev, M., D* lite, In: AAAI (2003), pp. 476–483.
Koenig, S.; Likhachev, M., Fast replanning for navigation in unknown terrain, Transactions on Robotics (2005).
Koenig, S.; Likhachev, M., Real-time adaptive A*, In: AAMAS (2006), pp. 281–288.
Koenig, S.; Likhachev, M.; Liu, Y.; Furcy, D., Incremental heuristic search in artificial intelligence, AI Magazine 24 (2) (2004) 99–112.
Koenig, S.; Mitchell, J.; Mudgal, A.; Tovey, C., A near-tight approximation algorithm for the robot localization problem, Journal on Computing 39 (2) (2009) 461–490.
Koenig, S.; Simmons, R.G., Complexity analysis of real-time reinforcement learning, In: AAAI (1993), pp. 99–105.
Koenig, S.; Simmons, R.G., Real-time search in non-deterministic domains, In: IJCAI (1995), pp. 1660–1667.
Koenig, S.; Simmons, R.G., The effect of representation and knowledge on goal-directed exploration with reinforcement-learning algorithms, Machine Learning 22 (1/3) (1996) 227–250.
Koenig, S.; Simmons, R.G., Easy and hard testbeds for real-time search algorithms, In: AAAI (1996), pp. 279–285.
Koenig, S.; Simmons, R., Xavier: A robot navigation architecture based on partially observable Markov decision process models, In: (Editors: Bonasso, R.; Kortenkamp, D.; Murphy, R.) Artificial Intelligence Based Mobile Robotics: Case Studies of Successful Robot Systems (1998) MIT Press, pp. 91–122.
Koenig, S.; Simmons, R.G., Solving robot navigation problems with initial pose uncertainty using real-time heuristic search, In: AIPS (1998), pp. 145–153.
Koenig, S.; Smirnov, Y.; Tovey, C., Performance bounds for planning in unknown terrain, Artificial Intelligence 147 (1–2) (2003) 253–279.
Koenig, S.; Szymanski, B., Value-update rules for real-time search, In: AAAI (1999), pp. 718–724.
Koenig, S.; Szymanski, B.; Liu, Y., Efficient and inefficient ant coverage methods, Annals of Mathematics and Artificial Intelligence 31 (2001) 41–76.
Koenig, S.; Tovey, C.; Halliburton, W., Greedy mapping of terrain, In: ICRA (2001), pp. 3594–3599.
Kohavi, Z., Switching and Finite Automata Theory. 2nd ed. (1978) McGraw-Hill .
Kohn, K., Molecular interaction map of the mammalian cell cycle control and DNA repair systems, Molecular Biology of the Cell 10 (8) (1999) 2703–2734.
Korf, R.E., Depth-first iterative-deepening: An optimal admissible tree search, Artificial Intelligence 27 (1) (1985) 97–109.
Korf, R.E., Macro-operators: A weak method for learning, Artificial Intelligence 26 (1985) 35–77.
Korf, R.E., Real-time heuristic search, Artificial Intelligence 42 (2–3) (1990) 189–211.
Korf, R.E., Multiplayer alpha-beta pruning, Artificial Intelligence 48 (1) (1991) 99–111.
Korf, R.E., Linear-space best-first search, Artificial Intelligence 62 (1993) 41–78.
Korf, R.E., Improved limited discrepancy search, In: IJCAI (1996), pp. 286–291.
Korf, R.E., Finding optimal solutions to Rubik's Cube using pattern databases, In: AAAI (1997), pp. 700–705.
Korf, R.E., A complete anytime algorithm for number partitioning, Artificial Intelligence 106 (1998) 181–203.
Korf, R.E., Divide-and-conquer bidirectional search: First results, In: IJCAI (1999), pp. 1184–1191.
Korf, R.E., A new algorithm for optimal bin packing, In: AAAI (2002), pp. 731–736.
Korf, R.E., Breadth-first frontier search with delayed duplicate detection, In: MOCHART (2003), pp. 87–92.
Korf, R.E., An improved algorithm for optimal bin packing, In: IJCAI (2003), pp. 1252–1258.
Korf, R.E., Optimal rectangle packing: Initial results, In: ICAPS (2003), pp. 287–295.
Korf, R.E., Best-first frontier search with delayed duplicate detection, In: AAAI (2004), pp. 650–657.
Korf, R.E., Optimal rectangle packing: New results, In: ICAPS (2004), pp. 142–149.
Korf, R.E., Minimizing disk I/O in two-bit breadth-first search, In: AAAI (2008), pp. 317–324.
Korf, R.E., Multi-way number partitioning, In: IJCAI (2009), pp. 538–543.
Korf, R.E., Objective functions multi-way number partitioning, In: SOCS (2010), pp. 71–72.
Korf, R.E.; Chickering, D.M., Best-first minimax search: Othello results, In: AAAI, Vol. 2 (1994), pp. 1365–1370.
Korf, R.E.; Felner, A., Disjoint pattern database heuristics, In: Chips Challenging Champions: Games, Computers and Artificial Intelligence (2002) Elsevier Sience, pp. 13–26.
Korf, R.E.; Felner, A., Recent progress in heuristic search: A case study of the four-peg towers of hanoi problem, In: IJCAI (2007), pp. 2324–2329.
Korf, R.E.; Reid, M., Complexity analysis of admissible heuristic search, In: AAAI (1998), pp. 305–310.
Korf, R.E.; Reid, M.; Edelkamp, S., Time complexity of Iterative-Deepening-A*, Artificial Intelligence 129 (1–2) (2001) 199–218.
Korf, R.E.; Schultze, T., Large-scale parallel breadth-first search, In: AAAI (2005), pp. 1380–1385.
Korf, R.E.; Taylor, L.A., Finding optimal solutions to the twenty-four puzzle, In: AAAI (1996), pp. 1202–1207.
Korf, R.E.; Zhang, W., Divide-and-conquer frontier search applied to optimal sequence alignment, In: AAAI (2000), pp. 910–916.
Korf, R.E.; Zhang, W.; Thayer, I.; Hohwald, H., Frontier search, Journal of the ACM 52 (5) (2005) 715–748.
Koza, J.R., Genetic Programming: On the Programming of Computers by Means of Natural Selection. (1992) MIT Press .
Koza, J.R., Genetic Programming II: Automatic Discovery of Reusable Programs. (1994) MIT Press .
Koza, J.R.; Bennett, H.B.; Andre, D.; Keane, M.A., Genetic Programming III: Darvinian Invention and Problem Solving. (1999) Morgan Kaufmann .
Kristensen, L.; Mailund, T., Path finding with the sweep-line method using external storage, In: ICFEM (2003), pp. 319–337.
Krueger, J.; Westermann, R., Linear algebra operators for GPU implementation of numerical algorithms, ACM Transactions on Graphics 22 (3) (2003) 908–916.
Kumar, V., Branch-and-bound search, In: (Editor: Shapiro, S.C.) Encyclopedia of Artificial Intelligence (1992) Wiley-Interscience, New York, pp. 1468–1472.
Kumar, V.; Ramesh, V.; Rao, V.N., Parallel best-first search of state-space graphs: A summary of results, In: AAAI (1987), pp. 122–127.
Kumar, V.; Schwabe, E.J., Improved algorithms and data structures for solving graph problems in external memory, In: IEEE-Symposium on Parallel and Distributed Processing (1996), pp. 169–177.
Kunkle, D.; Cooperman, D., Solving Rubik's Cube: Disk is the new RAM, Communications of the ACM 51 (4) (2008) 31–33.
Kupferschmid, S.; Dräger, K.; Hoffmann, J.; Finkbeiner, B.; Dierks, H.; Podelski, A.; et al., Uppaal/DMC—Abstraction-based heuristics for directed model checking, In: TACAS (2007), pp. 679–682.
Kupferschmid, S.; Helmert, M., A Skat player based on Monte-Carlo simulation, In: CG (2006), pp. 135–147.
Kupferschmid, S.; Hoffmann, J.; Dierks, H.; Behrmann, G., Adapting an AI planning heuristic for directed model checking, In: SPIN (2006), pp. 35–52.
Kvarnström, J.; Doherty, P.; Haslum, P., Extending TALplanner with concurrency and resources, In: ECAI (2000), pp. 501–505.
Kwa, J., BS*: An admissible bidirectional staged heuristic search algorithm, Artificial Intelligence 38 (2) (1994) 95–109.
Laarman, A.; van de Pol, J.; Weber, M., Boosting multi-core reachability performance with shared hash tables, In: FMCAD (2010).
Lago, U.D.; Pistore, M.; Traverso, P., Planning with a language for extended goals, In: AAAI (2002), pp. 447–454.
Land, A.H.; Doig, A.G., A tree-search algorithm for mixed integer programming problems, Econometria 28 (1960) 497–520.
Langley, P., Elements of Machine Learning. (1996) Morgan Kaufmann .
Larsen, B.J.; Burns, E.; Ruml, W.; Holte, R.C., Searching without a heuristic: Efficient use of abstraction, In: AAAI (2010).
Larsen, K.G.; Larsson, F.; Petterson, P.; Yi, W., Efficient verification of real-time systems: Compact data structures and state-space reduction, In: IEEE Real Time Systems Symposium (1997), pp. 14–24.
Larsen, K.G.; Behrmann, G.; Brinksma, E.; Fehnker, A.; Hune, T.S.; Petterson, P.; et al., As cheap as possible: Efficient cost-optimal reachability for priced timed automata, In: CAV (2001), pp. 493–505.
Latombe, J.-C., Robot Motion Planning. (1991) Kluwer Academic Publishers .
LaValle, S., Planning Algorithms. (2006) Cambridge University Press .
LaValle, S.; Kuffner, J., Rapidly-exploring random trees: Progress and prospects, In: Workshop on the Algorithmic Foundations of Robotics (2000).
Lawler, E.L., Combinatorial Optimization: Networks and Matroids. (1976) Holt, Rinehart, and Winston .
Lee, C.Y., Representation of switching circuits by binary-decision programs, Bell Systems Technical Journal 38 (1959) 985–999.
Lehmer, H.D., Mathematical methods in large-scale computing units, In: Symposium on Large-Scale Digital Calculating Machinery (1949) Harvard University Press, pp. 141–146.
Leiserson, C.E.; Saxe, J.B., A mixed integer linear programming problem which is efficiently solvable, In: CCCC (1983), pp. 204–213.
Lerda, F.; Sisto, R., Distributed-memory model checking with SPIN, In: SPIN (1999), pp. 22–39.
Lerda, F.; Visser, W., Addressing dynamic issues of program model checking, In: SPIN (2001), pp. 80–102.
Leven, P.; Mehler, T.; Edelkamp, S., Directed error detection in C++ with the assembly-level model checker StEAM, In: SPIN (2004), pp. 39–56.
Li, Y.; Harms, J.; Holte, R.C., IDA* MCSP: A fast exact MCSP algorithm, In: International conference on communications (2005), pp. 93–99.
Li, Y.; Harms, J.J.; Holte, R.C., Fast exact multiconstraint shortest path algorithms, In: International Conference on Communications (2007).
Likhachev, M.; Koenig, S., Incremental replanning for mapping, In: IROS (2002), pp. 667–672.
Likhachev, M.; Koenig, S., A generalized framework for Lifelong Planning A*, In: ICAPS (2005), pp. 99–108.
Lin, C.; Chang, R., On the dynamic shortest path problem, Journal of Information Processing 13 (4) (1990) 470–476.
Littman, M., Memoryless policies: Theoretical limitations and practical results, In: From Animals to Animats 3: International Conference on Simulation of Adaptive Behavior (1994).
Linares López, C., Multi-valued pattern databases, In: ECAI (2008), pp. 540–544.
Linares López, C., Vectorial pattern databases, In: ECAI (2010), pp. 1059–1060.
Linares López, C.; Borrajo, D., Adding diversity to classical heuristic planning, In: SOCS (2010), pp. 73–80.
Linares López, C.; Junghanns, A., Perimeter search performance, In: CG (2003), pp. 345–359.
Lluch-Lafuente, A., Symmetry reduction and heuristic search for error detection in model checking, In: MOCHART (2003), pp. 77–86.
Luckhardt, C.A.; Irani, K.B., An algorithmic solution of n-person games, In: AAAI (1986), pp. 158–162.
Lumelsky, V., Algorithmic and complexity issues of robot motion in an uncertain environment, Journal of Complexity 3 (1987) 146–182.
Lumelsky, V.; Stepanov, A., Path-planning strategies for a point mobile automaton moving amidst unknown obstacles of arbitrary shape, Algorithmica 2 (1987) 403–430.
Mackworth, A.K., Consistency in networks of relations, Artificial Intelligence 8 (1) (1977) 99–118.
Madani, O.; Hanks, S.; Condon, A., On the undecidability of probabilistic planning and infinite-horizon partially observable Markov decision problems, In: AAAI (1999), pp. 541–548.
Madras, N.; Slade, G., The Self-Avoiding Walk. (1993) Birkenhauser .
Mahapatra, N.R.; Dutt, S., Sequential and parallel branch-and-bound search under limited memory constraints, The IMA Volumes in Mathematics and Its Applications—Parallel Processing of Discrete Problems 106 (1999) 139–158.
Mandow, L.; Pérez de-la Cruz, J.-L., A note on the complexity of some multiobjective A* search algorithms, In: ECAI (2010), pp. 727–731.
Mandow, L.; Pérez de-la Cruz, J.-L., Multiobjective A* search with consistent heuristics, Journal of the ACM 57 (5) (2010).
Manzini, G., BIDA*, Artificial Intelligence 75 (2) (1995) 347–360.
Marais, H.; Bharat, K., Supporting cooperative and personal surfing with a desktop assistant, In: ACM Symposium on User Interface, Software and Technology (1997), pp. 129–138.
Mares, M.; Straka, M., Linear-time ranking of permutations, In: ESA (2007), pp. 187–193.
Marinari, E.; Parisi, G., Simulated tempering: A new Monte Carlo scheme, Europhysics Letters 21 (1992) 451–458.
Mariott, K.; Stuckey, P., Programming with Constraints. (1998) MIT Press .
Martelli, A., On the complexity of admissible search algorithms, Artificial Intelligence 8 (1997) 1–13.
Martello, S.; Toth, P., Lower bounds and reduction procedures for the bin packing problem, Discrete Applied Mathematics 28 (1990) 59–70.
Matthies, L.; Xiong, Y.; Hogg, R.; Zhu, D.; Rankin, A.; Kennedy, B.; et al., A portable, autonomous, urban reconnaissance robot, Robotics and Autonomous Systems 40 (2002) 163–172.
Mattmüller, R.; Ortlieb, M.; Helmert, M.; Bercher, P., Pattern database heuristics for fully observable nondeterministic planning, In: ICAPS (2010), pp. 105–112.
McAllester, D.A., Conspiricy-number-search for min-max searching, Artificial Intelligence 35 (1988) 287–310.
McAllester, D.; Yuret, D., Alpha-beta-conspiracy search, ICGA Journal 25 (2) (2002) 16–35.
McCreight, E.M., A space-economical suffix tree construction algorithm, Journal of the ACM 23 (2) (1976) 262–272.
McCreight, E.M., Priority search trees, SIAM Journal of Computing 14 (2) (1985) 257–276.
McMillan, K.L., Symbolic Model Checking. (1993) Kluwer Academic Press .
McNaughton, M.; Lu, P.; Schaeffer, J.; Szafron, D., Memory-efficient A* heuristics for multiple sequence alignment, In: AAAI (2002), pp. 737–743.
Mehler, T.; Edelkamp, S., Incremental hashing with pattern databases, In: ICAPS Poster Proceedings (2005).
Mehler, T.; Edelkamp, S., Dynamic incremental hashing in program model checking, ENTCS 149 (2) (2006).
Mehlhorn, K., Data Structures and Algorithms (2): NP Completeness and Graph Algorithms. (1984) Springer .
Mehlhorn, K.; Meyer, U., External-memory breadth-first search with sublinear I/O, In: ESA (2002), pp. 723–735.
Mehlhorn, K.; Näher, S., The LEDA Platform of Combinatorial and Geometric Computing. (1999) Cambridge University Press .
Mercer, E.; Jones, M., Model checking machine code with the GNU debugger, In: SPIN (2005), pp. 251–265.
Merino, P.; del Mar Gallardo, M.; Martinez, J.; Pimentel, E., aSPIN: A tool for abstract model checking, International Journal on Software Tools for Technology Transfer 5 (2–3) (2004) 165–184.
Meriott, K.; Stuckey, P., Programming with Constraints. (1998) MIT Press .
Mero, L., A heuristic search algorithm with modifiable estimate, Artificial Intelligence 23 (1984) 13–27.
Meseguer, P., Interleaved depth-first search, In: IJCAI (1997), pp. 1382–1387.
Metropolis, N.; Rosenbluth, A.W.; Rosenbluth, M.N.; Teller, A.H.; Teller, E., Equation of state calculations by fast computing machines, Journal of Chemical Physics 21 (1953) 1087–1092.
Milner, R., Communication and Concurrency. (2002) Prentice-Hall .
Milner, R., An algebraic definition of simulation between programs, In: IJCAI (2002), pp. 481–489.
Miltersen, P.B.; Radhakrishnan, J.; Wegener, I., On converting CNF to DNF, Theoretical Computer Science 347 (1–2) (2005) 325–335.
Minato, S.; Ishiura, N.; Yajima, S., Shared binary decision diagram with attributed edges for efficient boolean function manipuation, In: DAC (1990), pp. 52–57.
Miura, T.; Ishida, T., Statistical node caching for memory bounded search, In: AAAI (1998), pp. 450–456.
Moffitt, M.D.; Pollack, M.E., Optimal rectangle packing: A Meta-CSP approach, In: ICAPS (2006), pp. 93–102.
Mohr, R.; Henderson, T.C., Arc and path consistency revisited, Artificial Intelligence 28 (1) (1986) 225–233.
Monien, B.; Speckenmeyer, E., Solving satisfiability in less than 2n steps, Discrete Applied Mathematics 10 (1985) 287–294.
Moore, A.; Atkeson, C., Prioritized sweeping: Reinforcement learning with less data and less time, Machine Learning 13 (1) (1993) 103–130.
Moore, A.; Atkeson, C., The parti-game algorithm for variable resolution reinforcement learning in multi-dimensional state spaces, Machine Learning 21 (3) (1995) 199–233.
Moskewicz, M.; Madigan, C.; Zhao, Y.; Zhang, L.; Malik, S., Chaff: Engineering an efficient SAT solver, In: DAC (2001), pp. 236–247.
Mostow, J.; Prieditis, A.E., Discovering admissible heuristics by abstracting and optimizing, In: IJCAI (1989), pp. 701–707.
Mudgal, A.; Tovey, C.; Greenberg, S.; Koenig, S., Bounds on the travel cost of a Mars rover prototype search heuristic, SIAM Journal on Discrete Mathematics 19 (2) (2005) 431–447.
Mudgal, A.; Tovey, C.; Koenig, S., Analysis of greedy robot-navigation methods, In: Proceedings of the International Symposium on Artificial Intelligence and Mathematics (2004).
Mues, C.; Vanthienen, J., Improving the scalability of rule base verification, In: KI (2004), pp. 381–395.
Müller, M., Partial order bounding: A new approach to evaluation in game tree search, Artificial Intelligence 129 (1–2) (2001) 279–311.
Müller, M., Proof set search, CG (2002) 88–107.
Munagala, K.; Ranade, A., I/O-complexity of graph algorithms, In: SODA (1999), pp. 687–694.
Munro, J.I.; Raman, V., Selection from read-only memory and sorting with minimum data movement, Theoretical Computer Science 165 (1996) 311–323.
Myrvold, W.; Ruskey, F., Ranking and unranking permutations in linear time, Information Processing Letters 79 (6) (2001) 281–284.
Nau, D.S., Pathology on game trees revisited, and an alternative to minimaxing, Artificial Intelligence 21 (1983) 221–244.
Nau, D.S.; Kumar, V.; Kanal, L., General branch and bound, and its relation to A* and AO*, Artificial Intelligence 23 (1984) 29–58.
Needleman, S.; Wunsch, C., A general method applicable to the search for similarities in the amino acid sequences of two proteins, Journal of Molecular Biology 48 (1981) 443–453.
Niewiadomski, R.; Amaral, J.N.; Holte, R.C., Sequential and parallel algorithms for frontier A* with delayed duplicate detection, In: AAAI (2006).
Nilsson, N.J., Principles of Artificial Intelligence. (1980) Tioga Publishing Company .
Nipkow, T.; Paulson, L.C.; Wenzel, M., Isabelle/HOL—A Proof Assistant for Higher-Order Logic. (2002) Springer ; Vol. 2283 of LNCS.
Nourbakhsh, I., AAAI Spring Symposium on Planning with Incomplete Information for Robot Problems. Robot Information Packet (2002).
Nourbakhsh, I., Interleaving Planning and Execution for Autonomous Robots. (2002) Kluwer AcademicPublishers .
Nourbakhsh, I.; Genesereth, M., Assumptive planning and execution: A simple, working robot architecture, Autonomous Robots Journal 3 (1) (1996) 49–67.
Okasaki, C., Purely Functional Data Structures. (1998) Cambridge University Press ; (chap. 3).
Osborne, M.J.; Rubinstein, A., A Course in Game Theory. (1994) MIT Press .
Ostlin, A.; Pagh, R., Uniform hashing in constant time and linear space, In: ACM Symposium on Theory of Computing (2003), pp. 622–628.
Owen, G., Game Theory. (1982) Academic Press .
Owens, J.D.; Houston, M.; Luebke, D.; Green, S.; Stone, J.E.; Phillips, J.C., GPU computing, Proceedings of the IEEE 96 (5) (2008) 879–899.
Owre, S.; Rajan, S.; Rushby, J.M.; Shankar, N.; Srivas, M.K., PVS: Combining specification, proof checking, and model checking, In: CAV (1996), pp. 411–414.
Pagh, R.; Rodler, F.F., Cuckoo hashing, In: ESA (2001), pp. 121–133.
Pai, D.K.; Reissell, L.-M., Multiresolution rough terrain motion planning, IEEE Transactions on Robotics and Automation 14 (1) (1998) 19–33.
Papadimitriou, C.; Tsitsiklis, J., The complexity of Markov decision processes, Mathematics of Operations Research 12 (3) (1987) 441–450.
Papadimitriou, C.; Yannakakis, M., Shortest paths without a map, Theoretical Computer Science 84 (1) (1991) 127–150.
Parberry, I., A real-time algorithm for the (n2 − 1)-puzzle, Information Processing Letters 56 (1995) 23–28.
Park, S.K.; Miller, K.W., Random number generators: Good ones are hard to find, Communications of the ACM 31 (1988) 1192–1201.
Paturi, R.; Pudlák, P.; Zane, F., Satisfiability coding lemma, In: FOCS (1977), pp. 566–574.
Pearl, J., Heuristics. (1985) Addison-Wesley .
Pednault, E.P.D., Generalizing nonlinear planning to handle complex goals and actions with context-dependent effects, In: IJCAI (1991), pp. 240–245.
Peled, D.A., Combining partial order reductions with on-the-fly model-checking, Formal Methods in Systems Design 8 (1996) 39–64.
Peled, D.A., Ten years of partial order reduction, In: CAV (1998), pp. 17–28.
Pemberton, J.; Korf, R.E., Incremental path planning on graphs with cycles, In: ICAPS (1992), pp. 179–188.
Pemberton, J.; Korf, R.E., Incremental search algorithms for real-time decision making, In: ICAPS (1994), pp. 140–145.
Phillips, J.C.; Braun, R.; Wang, W.; Gumbart, J.; Tajkhorshid, E.; Villa, E.; Chipot, C.; Skeel, R.D.; Kalé, L; Schulten, K., Scalable molecular dynamics with NAMD, Journal of Computational Chemistry 26 (16) (2005) 1781–1802.
Pinter, R.Y.; Rokhlenko, O.; Yeger-Lotem, E.; Ziv-Ukelson, M., Alignment of metabolic pathways, BioInformatics 21 (16) (2005) 3401–3408.
Pirzadeh, A.; Snyder, W., A unified solution to coverage and search in explored and unexplored terrains using indirect control, In: ICRA (1990), pp. 2113–2119.
Pistore, M.; Traverso, P., Planning as model checking for extended goals in non-deterministic domains, In: IJCAI (2001), pp. 479–486.
Plaat, A.; Schaeffer, J.; Pijls, W.; de Bruin, A., Best-first fixed-depth minimax algorithms, Artificial Intelligence 87 (1–2) (1996) 255–293.
Pohl, I., Bi-directional search, Machine Intelligence 6 (1971) 127–140.
Pohl, I., Heuristic search viewed as a path problem, Artificial Intelligence 1 (1977) 193–204.
Pohl, I., Practical and theoretical considerations in heuristic search algorithms, Machine Intelligence 8 (1977) 55–72.
Politowski, G.; Pohl, I., D-node retargeting in bidirectional heuristic search, In: AAAI (1984), pp. 274–277.
Powley, C.; Korf, R.E., Single-agent parallel window search, IEEE Transaction on Pattern Analysis and Machine Intelligence 4 (5) (1991) 466–477.
Preditis, A., Machine discovery of admissible heurisitics, Machine Learning 12 (1993) 117–142.
Preece, A.; Shinghal, R., Foundations and application of knowledge base verification, International Journal on Intelligent Systems Intelligence 9 (8) (1994) 683–701.
Prendinger, H.; Ishizuka, M., APS, a prolog-based anytime planning system, In: Proceedings 11th International Conference on Applications of Prolog (INAP) (1998).
Provost, F., Iterative weakening: Optimal and near-optimal policies for the selection of search bias, In: AAAI (1993), pp. 769–775.
Qian, K.; Nymeyer, A., Heuristic search algorithms based on symbolic data structures, In: ACAI (2003), pp. 966–979.
Qian, K.; Nymeyer, A., Guided invariant model checking based on abstraction and symbolic pattern databases, In: TACAS (2004), pp. 497–511.
Ramalingam, G.; Reps, T., An incremental algorithm for a generalization of the shortest-path problem, Journal of Algorithms 21 (1996) 267–305.
Rao, C.; Arkin, A., Control motifs for intracellular regulatory networks, Annual Review of Biomedical Engineering 3 (2001) 391–419.
Rao, V.N.; Kumar, V.; Korf, R.E., Depth-first vs. best-first search, In: AAAI (1991), pp. 434–440.
Rapoport, A., Two-Person Game Theory. (1966) Dover .
Rasmussen, J.I.; Larsen, K.G.; Subramani, K., Resource-optimal scheduling using priced timed automata, In: TACAS (2004), pp. 220–235.
Ratner, D.; Warmuth, M.K., The (n2 − 1)-puzzle and related relocation problems, Journal of Symbolic Computation 10 (2) (1990) 111–137.
Reffel, F.; Edelkamp, S., Error detection with directed symbolic model checking, In: FM (1999), pp. 195–211.
Regin, J.-C., A filtering algorithm for constraints of difference in CSPS, In: AAAI (1994), pp. 362–367.
Reinefeld, A.; Marsland, T.A., Enhanced iterative-deepening search, IEEE Transactions on Pattern Analysis and Machine Intelligence 16 (7) (1994) 701–710.
Reingold, O., Undirected st-connectivity in log-space, In: STOC (2005), pp. 376–385.
Reisch, S., Hex ist PSPACE-vollständig, Acta Informatica 15 (1981) 167–191.
Rich, E.; Knight, K., Artificial Intelligence. (1991) McGraw-Hill .
Richter, S.; Helmert, M.; Gretton, C., A stochastic local search approach to vertex cover, In: KI (2007), pp. 412–426.
Richter, S.; Helmert, M.; Westphal, M., Landmarks revisited, In: AAAI (2008), pp. 975–982.
Rintanen, J., Incorporation of temporal logic control into plan operators, In: ECAI (2000), pp. 526–530.
Rintanen, J., Symmetry reduction for SAT representations of transition systems, In: ICAPS (2003), pp. 32–41.
Rintanen, J., Unified definition of heuristics for classical planning, In: ECAI (2006), pp. 600–604.
Rivest, R.L., Partial-match retrieval algorithms, SIAM Journal of Computing 5 (1) (1976) 19–50.
Robby, Dwyer, M.B.; Hatcliff, J., Bogor: An extensible and highly-modular software model checking framework, In: ESEC (2003), pp. 267–276.
Rohnert, H., A dynamization of the all pairs least cost path problem, In: STACS (1985), pp. 279–286.
Romein, J.W.; Bal, H.E., Solving Awari with parallel retrograde analysis, Computer 36 (10) (2003) 26–33.
Romein, J.W.; Plaat, A.; Bal, H.E.; Schaeffer, J., Transposition table driven work scheduling in distributed search, In: AAAI (1999), pp. 725–731.
Romero, L.; Morales, E.; Sucar, E., An exploration and navigation approach for indoor mobile robots considering sensor's perceptual limitations, In: ICRA (2001), pp. 3092–3097.
Rossi, F.; van Beek, P.; Walsh, T., Handbook of Constraint Programming (Foundations of Artificial Intelligence). (2006) Elsevier Science, New York .
Rousset, P., On the consistency of knowledge bases, the COVADIS system, Computational Intelligence 4 (1988) 166–170.
In: (Editor: G., Rozenberg) Handbook of Graph Grammars and Computing by Graph Transformations (1997) World Scientific.
Ruan, Y.; Kautz, H.; Horvitz, E., The backdoor key: A path to understanding problem hardness, In: AAAI (2004).
Russell, S., Efficient memory-bounded search methods, In: ECAI (1992) Wiley, pp. 1–5.
Russell, S.; Norvig, P., Artificial Intelligence: A Modern Approach. (2003) Prentice-Hall .
Russell, S.; Wefald, E., Do the Right Thing–Studies in Limited Rationality. (1991) MIT Press .
Ryoo, H.S.; Sahinidis, N.V., A branch-and-reduce approach to global optimization, Journal of Global Optimization 8 (2) (1996) 107–139.
Sacerdoti, E., Planning in a hierarchy of abstraction spaces, Artificial Intelligence 5 (1997) 115–135.
Samadi, M.; Felner, A.; Schaeffer, J., Learning from multiple heuristics, In: AAAI (2008), pp. 357–362.
Samadi, M.; Siabani, M.; Holte, R.C.; Felner, A., Compressing pattern databases with learning, In: ECAI (2008), pp. 495–499.
Samuel, A.L., Some studies in machine learning using the game of checkers, IBM Journal on Research and Development 3 (1959) 210–229.
Sanders, P.; Meyer, U.; Sibeyn, J.F., Algorithms for Memory Hierarchies. (2002) Springer .
Savitch, W.J., Relationships between nondeterministic and deterministic tape complexities, Journal of Computer and System Sciences 4 (2) (1970) 177–192.
Sawatzki, D., A symbolic approach to the all-pairs shortest-paths problem, In: WG (2004), pp. 154–167.
Sawatzki, D., Implicit flow maximization by iterative squaring, In: SOFSEM (2004), pp. 301–313.
Schaeffer, J., The history heuristic and alpha-beta search enhancements in practice, IEEE Transactions on Pattern Analysis and Machine Intelligence 11 (1989) 1203–1212.
Schaeffer, J., One Jump Ahead: Challenging Human Supremacy in Checkers. (1997) Springer .
Schaeffer, J.; Björnsson, Y.; Burch, N.; Kishimoto, A.; Müller, M., Solving checkers, In: IJCAI (2005), pp. 292–297.
Schaeffer, J.; Burch, N.; Björnsson, Y.; Kishimoto, A.; Müller, M.; Lake, R.; et al., Checkers is solved, Science 317 (5844) (2007) 1518–1522.
Schapire, R., The Design and Analysis of Efficient Learning Algorithms. (1992) MIT Press .
Schiffel, S.; Thielscher, M., Fluxplayer: A successful general game player, In: AAAI (2007), pp. 1191–1196.
Schlott, S., Vehicle Navigation: Route Planning, Positioning and Route Guidance. (1997) Verlag Moderne Industrie, Landsberg/Lech, Germany .
Schofield, P.D.A., Complete solution of the eight puzzle, In: Machine Intelligence, 2 (1967) Elsevier, pp. 125–133.
Schöning, U., A probabilistic algorithm for k-SAT based on limited local search and restart, Algorithmica 32 (4) (2002) 615–623.
Schrage, L., A more portable Fortran random number generator, ACM Transactions on Mathematical Software 5 (2) (1979) 132–138.
Schrödl, S., Explanation-based generalization in game playing: Quantitative results, In: ECML (1998), pp. 256–267.
Schrödl, S., An improved search algorithm for optimal multiple sequence alignment, Journal of Artificial Intelligence Research 23 (2005) 587–623.
Schrödl, S.; Wagstaff, K.; Rogers, S.; Langley, P.; Wilson, C., Mining GPS traces for map refinement, Data Mining Knowledge Discovery 9 (1) (2004) 59–87.
Schroeppel, R.; Shamir, A., A t = o(2n/2), s = o(2n/4) algorithm for certain NP-complete problems, SIAM Journal of Computing 10 (3) (1981) 456–464.
Schulz, F.; Wagner, D.; Weihe, K., Dijkstra's algorithm on-line: An empirical case study from public railroad transport, Journal of Experimental Algorithmics 5 (12) (2000) 110–114.
Schuppan, V.; Biere, A., Efficient reduction of finite state model checking to reachability analysis, International Journal on Software Tools for Technology Transfer 5 (2–3) (2004) 185–204.
Schwefel, H.-P., Evolution and Optimum Seeking. (1995) Wiley .
Sen, A.K.; Bagchi, A., Average-case analysis of heuristic search in tree-like networks, In: Search in Artificial Intelligence (1988), pp. 131–165.
Sen, A.K.; Bagchi, A., Fast recursive formulations for best-first search that allow controlled use of memory, In: IJCAI (1989), pp. 297–302.
Shannon, C.E., Programming a computer to play chess, Philosophical Magazine 41 (7) (1950) 256–275.
Shostak, R., Deciding linear inequalities by computing loop residues, Journal of the ACM 28 (1981) 769–779.
Shue, L.; Li, S.; Zamani, R., An intelligent heuristic algorithm for project scheduling problems, In: Annual Meeting of the Decision Sciences Institute (2001).
Shue, L.; Zamani, R., An admissible heuristic search algorithm, In: International Symposium on Methodologies for Intelligent Systems (1993), pp. 69–75.
Silver, D., Cooperative pathfinding, In: Conference on Artificial Intelligence and Interactive Digital Entertainment (2005), pp. 117–122.
Simmons, R.; Apfelbaum, D.; Burgard, W.; Fox, D.; Moors, M.; Thrun, S.; Younes, H, Coordination for multi-robot exploration and mapping, In: AAAI (1997), pp. 852–858.
Simmons, R.; Goodwin, R.; Koenig, S.; O'Sullivan, J.; Armstrong, G., Xavier: An autonomous mobile robot on the web, In: (Editors: Goldberg, R.; Siegwart, R.) Beyond Webcams: An Introduction to Online Robots (2001) MIT Press.
Singh, M., Path consistency revised, In: IEEE International Conference on Tools with Artificial Intelligence (1995), pp. 318–325.
Singh, K.; Fujimura, K., Map making by cooperating mobile robots, In: ICRA (1993), pp. 254–259.
Slaney, J.; Thiébaux, S., Blocks world revisited, Artificial Intelligence (2001) 119–153.
Slaney, J.; Walsh, T., Backbones in optimization and approximation, In: IJCAI (2001), pp. 254–259.
Sleator, D.; Tarjan, R., Amortized efficiency of list update and paging rules, Communications of the ACM 28 (2) (1985) 202–208.
Smith, D.E., Choosing objectives in over-subscription planning, In: ICAPS (2004), pp. 393–401.
Smith, S.J.J.; Nau, D.S.; Throop, T.A., Computer bridge—A big win for AI planning, AI Magazine 19 (2) (1998) 93–106.
Smith, D.E.; Weld, D.S., Temporal planning with mutual exclusion reasoning, In: IJCAI (1999), pp. 326–337.
Sobel, D., Longitude: The True Story of a Lone Genius Who Solved the Greatest Scientific Problem of His Time. (1996) Penguin Books .
Sobrinho, J.L., Algebra and algorithms for QoS path computation and hop-by-hop routing in the internet, IEEE/ACM Transactions on Networking 10 (4) (2002) 541–550.
Spira, P.; Pan, A., On finding and updating spanning trees and shortest paths, SIAM Journal on Computing 4 (1975) 375–380.
Spouge, J.L., Speeding up dynamic programming algorithms for finding optimal lattice paths, SIAM Journal of Applied Mathematics 49 (5) (1989) 1552–1566.
Stasko, J.T.; Vitter, J.S., Pairing heaps: Experiments and analysis, Communications of the ACM 30 (3) (1987) 234–249.
Stentz, A., Optimal and efficient path planning for unknown and dynamic environments, International Journal of Robotics and Automation 10 (3) (1995) 89–100.
Stentz, A., The focussed D* algorithm for real-time replanning, In: Proceedings of the International Joint Conference on Artficial Intelligence (1995), pp. 1652–1659.
Stentz, A., Best information planning for unknown, uncertain, and changing domains, In: AAAI Workshop on Online Search (1997), pp. 110–113.
Stentz, A.; Hebert, M., A complete navigation system for goal acquisition in unknown environments, Autonomous Robots 2 (2) (1995) 127–145.
Stephen, G.A., String Searching Algorithms. (1994) World Scientific Publishing .
Stern, U.; Dill, D.L., Combining state space caching and hash compaction, In: Methoden des Entwurfs und der verifikation digitaler systeme, 4. GI/ITG/GME Workshop (1996) Shaker Verlag, pp. 81–90.
Stern, U.; Dill, D.L., Parallelizing the Murϕ Verifier, In: CAV (1997), pp. 256–267.
Stern, R.; Kalech, M.; Felner, A., Searching for a k-clique in unknown graphs, In: SOCS (2010), pp. 83–89.
Stern, R.; Puzis, R.; Felner, A., Potential search: A greedy anytime heuristic search, In: SOCS (2010), pp. 119–120.
Stockman, G.C., A minimax algorithm better than alpha-beta, Artificial Intelligence 12 (2) (1997) 179–196.
Sturtevant, N., An analysis of UCT in multi-player games, In: CG (2008), pp. 37–49.
Sturtevant, N.; Bowling, M., Robust game play against unknown opponents, In: AAAI (2006), pp. 96–109.
Sturtevant, N.; Korf, R.E., On pruning techniques for multi-player games, In: AAAI (2000), pp. 201–207.
Sturtevant, N.; Zhang, Z.; Holte, R.C.; Schaeffer, J., Using inconsistent heuristics on A* search, In: AAAI, Workshop on Search Techniques in Artificial Intelligence and Robotics (2008).
Sulewski, D.; Edelkamp, S.; Kissmann, P., Exploiting the computational power of the graphics cards: Optimal state space planning on the GPU, In: ICAPS (2011), pp. 242–249; Submitted.
Sutherland, I., A method for solving arbitrary-wall mazes by computer, IEEE Transactions on Computers C–18 (12) (1969) 1092–1097.
Sutton, R., DYNA, an integrated architecture for learning, planning, and reacting, SIGART Bulletin 2 (4) (1991) 160–163.
Sutton, R.S., Learning to predict by the methods of temporal differences, Machine Learning 3 (1988) 9–44.
Sutton, A.M.; Howe, A.E.; Whitley, L.D., Directed plateau search for MAX-k-SAT, In: SOCS (2010), pp. 90–97.
Svennebring, J.; Koenig, S., Building terrain-covering ant robots, Autonomous Robots 16 (3) (2004) 313–332.
Tarjan, R.E., Data Structures and Network Algorithms. (1983) SIAM .
Tesauro, G., Temporal difference learning and TD-Gammon, Communication of the ACM 38 (3) (1995) 58–68.
Thagard, P., Pathways to biomedical discovery, Philosophy of Science 70 (2003) 2003.
Thayer, S.; Digney, B.; Diaz, M.; Stentz, A.; Nabbe, B.; Hebert, M., Distributed robotic mapping of extreme environments, In: SPIE: Mobile Robots XV and Telemanipulator and Telepresence Technologies VII, Vol. 4195 (2000).
Thayer, J.; Ruml, W., Anytime heuristic search: Frameworks and algorithms, In: SOCS (2010).
Thorup, M., Undirected single-source shortest paths with positive integer weights in linear time, Journal of the ACM 46 (1999) 362–394.
Thorup, M., On RAM priority queues, SIAM Journal of Computing 30 (2000) 86–109.
Thrun, S., The role of exploration in learning control, In: Handbook for Intelligent Control: Neural, Fuzzy and Adaptive Approaches (1992) Van Nostrand Reinhold.
Thrun, S., Probabilistic algorithms in robotics, AI Magazine 21 (4) (2000) 93–109.
Thrun, S.; Bücken, A.; Burgard, W.; Fox, D.; Fröhlinghaus, T.; Hennig, D.; et al., Map learning and high-speed navigation in RHINO, In: (Editors: Kortenkamp, D.; Bonasso, R.; Murphy, R.) Artificial Intelligence Based Mobile Robotics: Case Studies of Successful Robot Systems (1998) MIT Press, pp. 21–52.
Thrun, S.; Burgard, W.; Fox, D., Probabilistic Robotics. (2005) MIT Press .
Torasso, P.; Torta, G., Computing minimal-cardinality diagnoses using BDDs, In: KI (2003), pp. 224–238.
Tovey, C.; Koenig, S., Gridworlds as testbeds for planning with incomplete information, In: AAAI (2000), pp. 819–824.
Tovey, C.; Koenig, S., Improved analysis of greedy mapping, In: Proceedings of the International Conference on Intelligent Robots and Systems (2003), pp. 3251–3257.
Tovey, C.; Koenig, S., Localization: Approximation and performance bounds for minimizing travel distance, IEEE Transactions on Robotics 26 (2) (2010) 320–330.
Tromp, J., Solving connect-4 on medium board sizes, ICGA Journal 31 (2) (2008) 110–112.
Tsang, T., Foundations of Constraint Satisfaction. (1993) Academic Press .
Turing, A.M.; Strachey, C.; Bates, M.A.; Bowden, B.V., Digital computers applied to games, In: (Editor: Bowden, B.V.) Faster Than Thought (1953) Putnam, pp. 286–310.
Ukkonen, E., Algorithms for approximate string matching, Information and Control 64 (1985) 110–118.
Valmari, A., A stubborn attack on state explosion, In: CAV (1991), pp. 156–165.
Valtorta, M., A result on the computational complexity of heuristic estimates for the A* algorithm, Information Sciences 34 (1984) 48–59.
van den Herik, H.J.; Herschberg, I.S., A data base on data bases, ICCA Journal (1986) 29–34.
van Emde Boas, P.; Kaas, R.; Zijlstra, E., Design and implementation of an efficient priority queue, Mathematical Systems Theory 10 (1977) 99–127.
Van Hentenryck, P., Constraint Satisfaction in Logic Programming. (1989) MIT Press .
Van Hentenryck, P.; Deville, Y.; Teng, C.-M., A generic arc-consistency algorithm and its specializations, Artificial Intelligence 57 (1992) 291–321.
van Leeuwen, J.; Wood, D., Interval heaps, The Computer Journal 36 (1993) 209–216.
Visser, W.; Havelund, K.; Brat, G.; Park, S., Model Checking Programs, In: ICSE (2000), pp. 3–12.
Wagner, I.A.; Lindenbaum, M.; Bruckstein, A.M., Smell as a computational resource—A lesson we can learn from the ant, In: Israeli Symposium on Theory of Computing and Systems (ISTCS), Vol. 24 (1996), pp. 219–230.
Wagner, I.A.; Lindenbaum, M.; Bruckstein, A.M., Efficiently searching a graph by a smell-oriented vertex process, Annals of Mathematics and Artificial Intelligence 24 (1998) 211–223.
Wagner, I.; Lindenbaum, M.; Bruckstein, A., Distributed covering by ant robots using evaporating traces, IEEE Transactions on Robotics and Automation 15 (5) (1999) 918–933.
Wagner, D.; Willhalm, T., Geometric speed-up techniques for finding shortest paths in large sparse graphs, In: ESA (2003), pp. 776–787.
Wagner, D.; Willhalm, T.; Zaroliagis, C., Dynamic shortest path containers, ENTCS 92 (2004) 65–84.
Wah, B.; Shang, Y., Comparative study of IDA*-style searches, In: IJCAI (1994), pp. 290–296.
Walsh, T., Depth-bounded discrepancy search, In: IJCAI (1997), pp. 1388–1393.
Wang, C., Location estimation and uncertainty analysis for mobile robots, In: (Editors: Cox, I.; Wilfong, G.) Autonomous Robot Vehicles (1991) Springer.
Waterman, M.S., Introduction to Computational Biology: Maps, Sequences, and Genomes. (1995) Chapman and Hall .
Wegener, I., Branching Programs and Binary Decision Diagrams—Theory and Applications. (2000) SIAM .
Wehrle, M.; Kupferschmid, S.; Podelski, A., Useless actions are useful, In: ICAPS (2008), pp. 388–395.
Wickelgren, W.A., How to Solve Mathematical Problems. (1995) Dover .
Winter, S., Modeling costs of turns in route planning, GeoInformatica (2002) 345–361.
Woelfel, P., Symbolic topological sorting with OBDDs, Journal of Discrete Algorithms 4 (1) (2006) 51–71.
Wolper, P., Temporal logic can be more expressive, Information and Control 56 (1983) 72–99.
Yang, B.; Bryant, R.E.; O'Hallaron, D.R.; Biere, A.; Coudert, O.; Janssen, G.; et al., A performance study of BDD based model checking, In: FMCAD (1998), pp. 255–289.
Yang, F.; Culberson, J.C.; Holte, R.C.; Zahavi, U.; Felner, A., A general theory of additive state space abstractions, Journal of Artificial Intelligence Research 32 (2008) 631–662.
Yang, C.H.; Dill, D.L., Validation with guided search of the state space, In: DAC (1998), pp. 599–604.
Yanovski, V.; Wagner, I.; Bruckstein, A., A distributed ant algorithm for efficiently patrolling a network, Algorithmica 37 (2003) 165–186.
Yoshizumi, T.; Miura, T.; Ishida, T., A* with partial expansion for large branching factor problems, In: AAAI (2000), pp. 923–929.
Younger, D.H., Recognition and parsing of context-free languages in time n3, Information and Control 10 (2) (1967) 189–208.
Zahavi, U.; Felner, A.; Burch, N.; Holte, R.C., Predicting the performance of IDA* with conditional distributions, In: AAAI (2008), pp. 381–386.
Zahavi, U.; Felner, A.; Holte, R.C.; Schaeffer, J., Duality in permutation state spaces and the dual search algorithm, Artificial Intelligence 172 (4–5) (2008) 514–540.
Zahavi, U.; Felner, A.; Schaeffer, J.; Sturtevant, N.R., Inconsistent heuristics, In: AAAI (2007), pp. 1211–1216.
Zelinsky, A., A mobile robot exploration algorithm, IEEE Transactions on Robotics and Automation 8 (6) (1992) 707–717.
Zhang, W., Complete anytime beam search, In: AAAI (1998), pp. 425–430.
Zhang, W., Configuration landscape analysis and backbone guided local search for satisfiability and maximum satisfiability, Artificial Intelligence 158 (1) (2004) 1–26.
Zhang, W., Phase transition and backbones of 3-SAT and Maximum 3-SAT, In: Principles and Practice of Constraint Programming (CP) (2004).
Zhang, W.; Sen, A.K.; Bagchi, A., An average-case analysis of graph search, In: AAAI (1999), pp. 757–762.
Zhang, Z.; Sturtevant, N.R.; Holte, R.C.; Schaeffer, J.; Felner, A., A* search with inconsistent heuristics, In: IJCAI (2009), pp. 634–639.
Zhang, Y.; Yap, R.H.C., Making AC-3 an optimal algorithm, In: IJCAI (2001), pp. 316–321.
Zhao, Y., Vehicle Location and Navigation Systems. (1997) Artech House Inc. .
Zhou, R.; Hansen, E.A., Memory-bounded A* graph search, In: Conference of the Florida Artificial Intelligence Research Society (FLAIRS) (2002).
Zhou, R.; Hansen, E.A., Multiple sequence alignment using A*, In: AAAI (2002); Student abstract.
Zhou, R.; Hansen, E.A., Sparse-memory graph search, In: IJCAI (2003), pp. 1259–1268.
Zhou, R.; Hansen, E.A., Sweep A*: Space-efficient heuristic search in partially-ordered graphs, In: ICTAI (2003), pp. 688–695.
Zhou, R.; Hansen, E.A., Breadth-first heuristic search, In: ICAPS (2004), pp. 92–100.
Zhou, R.; Hansen, E.A., Space-efficient memory-based heuristics, In: AAAI (2004), pp. 677–682.
Zhou, R.; Hansen, E.A., Structured duplicate detection in external-memory graph search, In: AAAI (2004), pp. 683–689.
Zhou, R.; Hansen, E.A., External-memory pattern databases using structured duplicate detection, In: AAAI (2005).
Zhou, R.; Hansenm, E.A., Beam-stack search: Integrating backtracking with beam search, In: ICAPS (2005), pp. 90–98.
Zhou, R.; Hansen, E.A., A breadth-first approach to memory-efficient graph search, In: AAAI (2006), pp. 1695–1698.
Zhou, R.; Hansen, E.A., Domain-independent structured duplicate detection, In: AAAI (2006), pp. 1082–1087.
Zhou, R.; Hansen, E.A., Edge partitioning in external-memory graph search, In: IJCAI (2007), pp. 2410–2417.
Zhou, R.; Hansen, E.A., Parallel structured duplicate detection, In: AAAI (2007), pp. 1217–1222.
Zhou, R.; Hansen, E.A., Combining breadth-first and depth-first strategies in searching for treewidth, In: AAAI, Workshop on Search Techniques in Artificial Intelligence and Robotics (2008).
Zhou, R.; Schmidt, T.; Hansen, E.A.; Do, M.; Uckun, S., Edge partitioning in parallel structured duplicate detection, In: SOCS (2010), pp. 137–138.
Zilberstein, S.; Russell, S., Anytime sensing, planning and action: A practical model for robot control, In: IJCAI (1993), pp. 1402–1407.
Zilles, S.; Holte, R.C., The computational complexity of avoiding spurious states in state space abstraction, Artificial Intelligence 174 (14) (2010) 1072–1092.
Zomaya, A., The Parallel and Distributed Computing Handbook. (1996) McGraw-Hill .
..................Content has been hidden....................
You can't read the all page of ebook, please click here login for view all page.