Sciweavers

1201 search results - page 189 / 241
» Linear Probing and Graphs
Sort
View
AAAI
2006
14 years 12 days ago
Improved Bounds for Computing Kemeny Rankings
Voting (or rank aggregation) is a general method for aggregating the preferences of multiple agents. One voting rule of particular interest is the Kemeny rule, which minimizes the...
Vincent Conitzer, Andrew J. Davenport, Jayant Kala...
AAAI
2006
14 years 12 days ago
Cost-Optimal External Planning
This paper considers strategies for external memory based optimal planning. An external breadth-first search exploration algorithm is devised that is guaranteed to find the costop...
Stefan Edelkamp, Shahid Jabbar
NIPS
2004
14 years 12 days ago
Triangle Fixing Algorithms for the Metric Nearness Problem
Various problems in machine learning, databases, and statistics involve pairwise distances among a set of objects. It is often desirable for these distances to satisfy the propert...
Inderjit S. Dhillon, Suvrit Sra, Joel A. Tropp
SPLST
2003
14 years 11 days ago
How to Draw a Sequence Diagram
Abstract. In this paper, we consider the aesthetic criteria and constraints related to the layouts of UML sequence diagrams. We consider the applicability of the traditional graph ...
Timo Poranen, Erkki Mäkinen, Jyrki Nummenmaa
DISOPT
2008
93views more  DISOPT 2008»
13 years 11 months ago
Exploiting planarity in separation routines for the symmetric traveling salesman problem
At present, the most successful approach to solving large-scale instances of the Symmetric Traveling Salesman Problem to optimality is branch-and-cut. The success of branch-and-cu...
Adam N. Letchford, Nicholas A. Pearson