Research Publications

Placeholder
 
Search | Show all
All
Narrow your search
« 1 2 3 4 5 ... 15 16 »

Results per Page 10 25 50 100 250
151 result(s)
By Type
By Year
By Research Group
We present an algorithm to nd optimal routes in a multi-modal public transportation network. Our model takes into account many realistic features such as walking between multi-modal stations, transfer times, trac days, multiple objectives and nding ...
Intelligent Transport Systems World Congress - October 2012
Jessica Davies, Nina Narodytska, Toby Walsh
Successive elimination of candidates is often a route to making manipulation intractable to compute. We prove that eliminating candidates does not necessarily increase the computational complexity of manipulation. However, for many voting rules used ...
Association for the Advancement of Artificial Intelligence (AAAI 2012) - July 2012
Symmetry is an important problem in many combinatorial problems. One way of dealing with symmetry is to add constraints that eliminate symmetric solutions. We survey recent results in this area, focusing especially on two common and useful cases: ...
Association for the Advancement of Artificial Intelligence (AAAI 2012) - July 2012
Carleton Coffrin, Pascal Van Hentenryck, Russell Bent
This paper considers the restoration of multiple interdependent infrastructures after a man-made or natural disaster. Modern infrastructures feature complex cyclic interdependencies and require a holistic restoration process. This paper presents the ...
Twenty-Sixth Conference on Artificial Intelligence (AAAI-12) - July 2012
Carleton Coffrin, Pascal Van Hentenryck
This paper studies the applicability of the linearized DC model in optimizing power restoration after significant network disruptions. In such circumstances, no AC base-point solution exists and the objective is to maximize the served load. The paper ...
IEEE Power and Energy Annual Meeting - July 2012
Carleton Coffrin, Pascal Van Hentenryck
This paper studies the applicability of the linearized DC model in optimizing power restoration after significant network disruptions. In such circumstances, no AC base-point solution exists and the objective is to maximize the served load. The paper ...
IEEE Power and Energy General Meeting - July 2012
We present a novel method for computing increasing lower bounds on the cost of solving planning problems, based on repeatedly solving and strengthening the delete relaxation of the problem. Strengthening is done by compiling select conjunctions into ...
International Conference on Automated Planning and Scheduling (ICAPS) - June 2012
We present a simple and efficient algorithm to solve delete-free planning problems optimally and calculate the \h{+} heuristic. Like another recently proposed approach, the algorithm computes a minimum-cost hitting set for a complete set of disjunctive...
International Conference on Automated Planning and Scheduling (ICAPS) - June 2012
Emil Keyder, Joerg Hoffmann, Patrik Haslum
Heuristics based on the delete relaxation are at the forefront of modern domain-independent planning techniques. Here we introduce a principled and flexible technique for augmenting delete-relaxed tasks with a limited amount of delete ...
International Conference on Automated Planning and Scheduling (ICAPS) - June 2012
Existing ship scheduling approaches either ignore constraints on ship draft (distance between the waterline and the keel), or model these in very simple ways, such as a constant draft limit that does not change with time. However, in most ports the ...
International Conference on Automated Planning and Scheduling (ICAPS) - June 2012