Sciweavers

1395 search results - page 259 / 279
» (k, )-Distance-Hereditary Graphs
Sort
View
AAAI
2010
13 years 10 months ago
Fast Local Search Algorithm for Weighted Feedback Arc Set in Tournaments
We present a fast local search algorithm that finds an improved solution (if there is any) in the k-exchange neighborhood of the given solution to an instance of WEIGHTED FEEDBACK...
Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman...
LREC
2010
179views Education» more  LREC 2010»
13 years 10 months ago
Building a Bank of Semantically Encoded Narratives
We propose a methodology for a novel type of discourse annotation whose model is tuned to the analysis of a text as narrative. This is intended to be the basis of a "story ba...
David K. Elson, Kathleen McKeown
SODA
2008
ACM
96views Algorithms» more  SODA 2008»
13 years 10 months ago
Greedy drawings of triangulations
Greedy Routing is a class of routing algorithms in which the packets are forwarded in a manner that reduces the distance to the destination at every step. In an attempt to provide...
Raghavan Dhandapani
CSREAESA
2004
13 years 10 months ago
An Energy-Aware Synthesis Methodology for OS-Driven Multi-Process Embedded Software
The growing software content in various battery-driven embedded systems has led to significant interest in technologies for energy-efficient embedded software. While lowenergy sof...
Tat Kee Tan, Anand Raghunathan, Niraj K. Jha
SODA
2004
ACM
144views Algorithms» more  SODA 2004»
13 years 9 months ago
Covering minimum spanning trees of random subgraphs
We consider the problem of finding a sparse set of edges containing the minimum spanning tree (MST) of a random subgraph of G with high probability. The two random models that we ...
Michel X. Goemans, Jan Vondrák