Sciweavers

1447 search results - page 192 / 290
» Graphs and Path Equilibria
Sort
View
ISAAC
2000
Springer
110views Algorithms» more  ISAAC 2000»
15 years 10 months ago
Online Routing in Convex Subdivisions
We consider online routing algorithms for finding paths between the vertices of plane graphs. We show (1) there exists a routing algorithm for arbitrary triangulations that has no...
Prosenjit Bose, Pat Morin, Andrej Brodnik, Svante ...
WSC
2008
15 years 8 months ago
A multi threaded and resolution approach to simulated futures evaluation
As part of the DARPA Deep Green efforts, SAIC developed a multi-threaded and resolution approach to constructing and evaluating simulated futures to address the SimPath component....
David R. Pratt, Robert W. Franceschini, Robert B. ...
NAACL
2007
15 years 7 months ago
Randomized Decoding for Selection-and-Ordering Problems
The task of selecting and ordering information appears in multiple contexts in text generation and summarization. For instance, methods for title generation construct a headline b...
Pawan Deshpande, Regina Barzilay, David R. Karger
OPODIS
2007
15 years 7 months ago
Distributed Approximation Algorithms for Finding 2-Edge-Connected Subgraphs
Abstract. We consider the distributed construction of a minimum weight 2edge-connected spanning subgraph (2-ECSS) of a given weighted or unweighted graph. A 2-ECSS of a graph is a ...
Sven Oliver Krumke, Peter Merz, Tim Nonner, Kathar...
CONCUR
2010
Springer
15 years 7 months ago
Parameterized Verification of Ad Hoc Networks
We study decision problems for parameterized verification of a formal model of Ad Hoc Networks with selective broadcast and spontaneous movement. The communication topology of a ne...
Giorgio Delzanno, Arnaud Sangnier, Gianluigi Zavat...