1395 search results - page 259 / 279 » (k, )-Distance-Hereditary Graphs |
110
Voted
AAAI
2010
15 years 2 months ago
2010
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...
94
Voted
LREC
2010
15 years 2 months ago
2010
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...
116
click to vote
SODA
2008
ACM
15 years 2 months ago
2008
ACM
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...
129
Voted
CSREAESA
2004
15 years 2 months ago
2004
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...
105
click to vote
SODA
2004
ACM
15 years 2 months ago
2004
ACM
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 ...