1002 search results - page 129 / 201 » Towards Graph Programs for Graph Algorithms |
150
click to vote
INFOCOM
2000
IEEE
15 years 6 months ago
2000
IEEE
An efficient and general graph-theoretic model (the Wavelength-Graph (WG)) has been proposed which enables solving the static Routing and Wavelength Assignment (RWA) problems in Mu...
126
click to vote
MOBIHOC
2005
ACM
16 years 2 months ago
2005
ACM
Location information is very useful in the design of sensor network infrastructures. In this paper, we study the anchor-free 2D localization problem by using local angle measureme...
149
Voted
ISBRA
2009
Springer
15 years 9 months ago
2009
Springer
A tanglegram is a pair of trees on the same set of leaves with matching leaves in the two trees joined by an edge. Tanglegrams are widely used in biology – to compare evolutiona...
136
Voted
ICML
2008
IEEE
16 years 3 months ago
2008
IEEE
In inductive logic programming, subsumption is a widely used coverage test. Unfortunately, testing -subsumption is NP-complete, which represents a crucial efficiency bottleneck fo...
113
click to vote
CP
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. We present a parameterized approximation scheme for distributed combinatorial optimization problems based on dynamic programming. The algorithm is a utility propagation m...