Sciweavers

2834 search results - page 182 / 567
» Representing Trees with Constraints
Sort
View
ECAI
2004
Springer
14 years 4 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
14 years 7 days 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...
IJCAI
2003
14 years 4 days ago
Great Expectations. Part I: On the Customizability of Generalized Expected Utility
We propose a generalization of expected utility that we call generalized EU (GEU), where a deci­ sion maker's beliefs are represented by plausibil­ ity measures and the dec...
Francis C. Chu, Joseph Y. Halpern
CVPR
2008
IEEE
14 years 5 months ago
Action recognition with motion-appearance vocabulary forest
In this paper we propose an approach for action recognition based on a vocabulary forest of local motionappearance features. Large numbers of features with associated motion vecto...
Krystian Mikolajczyk, Hirofumi Uemura
LICS
2008
IEEE
14 years 5 months ago
Context Matching for Compressed Terms
This paper is an investigation of the matching problem for term equations s = t where s contains context variables, and both terms s and t are given using some kind of compressed ...
Adria Gascón, Guillem Godoy, Manfred Schmid...