Sciweavers

2834 search results - page 74 / 567
» Representing Trees with Constraints
Sort
View
WINET
2011
13 years 3 months ago
Aggregation convergecast scheduling in wireless sensor networks
Abstract—We consider the problem of aggregation convergecast scheduling in wireless sensor networks. Aggregation convergecast differs from regular convergecast in that it accommo...
Baljeet Malhotra, Ioanis Nikolaidis, Mario A. Nasc...
ACCV
1998
Springer
14 years 1 months ago
Learning Multiscale Image Models of 2D Object Classes
This paper isconcerned with learning the canonical gray scalestructure of the images of a classof objects. Structure is defined in terms of the geometry and layout of salientimage...
Benoit Perrin, Narendra Ahuja, Narayan Srinivasa
ANTSW
2004
Springer
14 years 2 months ago
Search Bias in Constructive Metaheuristics and Implications for Ant Colony Optimisation
Constructive metaheuristics explore a tree of constructive decisions, the topology of which is determined by the way solutions are represented and constructed. Some solution repres...
James Montgomery, Marcus Randall, Tim Hendtlass
FOGA
2007
13 years 10 months ago
Saddles and Barrier in Landscapes of Generalized Search Operators
Barrier trees are a convenient way of representing the structure of complex combinatorial landscapes over graphs. Here we generalize the concept of barrier trees to landscapes deï...
Christoph Flamm, Ivo L. Hofacker, Bärbel M. R...
CORR
2008
Springer
92views Education» more  CORR 2008»
13 years 9 months ago
Fixed Parameter Polynomial Time Algorithms for Maximum Agreement and Compatible Supertrees
Consider a set of labels L and a set of trees T = {T (1) , T (2) , . . . , T (k) } where each tree T (i) is distinctly leaf-labeled by some subset of L. One fundamental problem is ...
Viet Tung Hoang, Wing-Kin Sung