6598 search results - page 444 / 1320 » Graph Theory with Applications |
217
click to vote
COCOA
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. The node-weighted Steiner tree problem is a variation of classical Steiner minimum tree problem. Given a graph G = (V, E) with node weight function C : V → R+ and a sub...
210
click to vote
HIPC
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. Large graphs involving millions of vertices are common in many practical applications and are challenging to process. Practical-time implementations using high-end comput...
190
click to vote
CSMR
2006
IEEE
16 years 27 days ago
2006
IEEE
A trace is a record of the execution of a computer program, showing the sequence of operations executed. A trace may be obtained through static or dynamic analysis. An object trac...
188
click to vote
IAT
2006
IEEE
16 years 27 days ago
2006
IEEE
In this paper, we propose a novel approach to solving the distributed constraint optimisation problem (DCOP) that guarantees completeness, while having linear communication comple...
208
click to vote
FASE
2005
Springer
16 years 11 days ago
2005
Springer
Modeling the dependencies between provided and required services within a software component is necessary for several reasons, such as automated component adaptation and architectu...