Sciweavers

1172 search results - page 73 / 235
» Path Algorithms on Regular Graphs
Sort
View
120
Voted
ASPDAC
1999
ACM
157views Hardware» more  ASPDAC 1999»
15 years 4 months ago
A Genetic Algorithm based Approach for Multi-Objective Data-Flow Graph Optimization
: This paper presents a genetic algorithm based approach for algebraic optimization of behavioral system specifications. We introduce a chromosomal representation of data-flow gr...
Birger Landwehr
212
Voted
ICDE
2003
IEEE
170views Database» more  ICDE 2003»
16 years 1 months ago
Keyword Proximity Search on XML Graphs
XKeyword provides efficient keyword proximity queries on large XML graph databases. A query is simply a list of keywords and does not require any schema or query language knowledg...
Vagelis Hristidis, Yannis Papakonstantinou, Andrey...
126
Voted
ESA
2006
Springer
139views Algorithms» more  ESA 2006»
15 years 4 months ago
Stochastic Shortest Paths Via Quasi-convex Maximization
Abstract. We consider the problem of finding shortest paths in a graph with independent randomly distributed edge lengths. Our goal is to maximize the probability that the path len...
Evdokia Nikolova, Jonathan A. Kelner, Matthew Bran...
WWW
2004
ACM
16 years 1 months ago
SPT-based topology algorithm for constructing power efficient wireless ad hoc networks
In this paper, we present a localized Shortest Path Tree (SPT) based algorithm for constructing a sub-network with the minimum-energy property for a given wireless ad hoc network....
Szu-Chi Wang, David S. L. Wei, Sy-Yen Kuo
97
Voted
ENTCS
2007
110views more  ENTCS 2007»
15 years 12 days ago
Algorithmic Techniques for Maintaining Shortest Routes in Dynamic Networks
In this paper, we survey algorithms for shortest paths in dynamic networks. Although research on this problem spans over more than three decades, in the last couple of years many ...
Camil Demetrescu, Giuseppe F. Italiano