Sciweavers

664 search results - page 71 / 133
» The tree Constraint
Sort
View
ICDCS
2006
IEEE
14 years 1 months ago
Greedy is Good: On Service Tree Placement for In-Network Stream Processing
This paper is concerned with reducing communication costs when executing distributed user tasks in a sensor network. We take a service-oriented abstraction of sensor networks, whe...
Zoë Abrams, Jie Liu
ECAI
2004
Springer
14 years 1 months ago
Local Search for Heuristic Guidance in Tree Search
Recent work has shown the promise in using local-search “probes” as a basis for directing a backtracking-based refinement search. In this approach, the decision about the next...
Alexander Nareyek, Stephen F. Smith, Christian M. ...
NETWORKING
2010
13 years 9 months ago
Cost Bounds of Multicast Light-Trees in WDM Networks
The construction of light-trees is one principal subproblem for multicast routing in sparse splitting Wavelength Division Multiplexing (WDM) networks. Due to the light splitting co...
Fen Zhou, Miklós Molnár, Bernard Cou...
AAAI
1996
13 years 9 months ago
Commitment Strategies in Hierarchical Task Network Planning
This paper compares three commitment strategies for HTN planning: (1) a strategy that delays variable bindings as much as possible; (2) a strategy in which no non-primitive task i...
Reiko Tsuneto, Kutluhan Erol, James A. Hendler, Da...
WADS
1997
Springer
88views Algorithms» more  WADS 1997»
13 years 11 months ago
Finding Cores of Limited Length
In this paper we consider the problem of nding a core of limited length in a tree. A core is a path, which minimizes the sum of the distances to all nodes in the tree. This proble...
Stephen Alstrup, Peter W. Lauridsen, Peer Sommerlu...