{"type":"ScholarlyArticle","title":"Search in a Small World","authors":[{"name":"Toby Walsh","slug":"toby-walsh","given":"Toby","family":"Walsh","affiliation":""}],"abstract":"In a graph with a \"small world\" topology, nodes are highly clustered yet the path length between them is small. Such a topology can make search problems very difficult since local decisions quickly propagate globally. We show that graphs a<>sociated with many different search problems have a small world topology, and that the cost of solving such search problems can have a heavy-tailed distribution. The strategy of randomization and restarts appears to eliminate these heavy tails. A novel restart schedule in which the cutoff bound is increased geometrically appears particularly effective.","doi":null,"url":"https://ijcai.org/proceedings/1999/166","pdf":"https://ijcai.org/proceedings/1999/0166.pdf","markdown":"https://ijcai.org/proceedings/1999/166.md","bibtex":"https://ijcai.org/proceedings/1999/bibtex/166","volume":{"slug":"1999","title":"Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 1999","url":"https://ijcai.org/proceedings/1999/","year":1999,"location":"Stockholm, Sweden","dates":"","editors":"Thomas Dean","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":"Search","track":"Search","number":166,"pages":{"first":1172,"last":1176},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}