Sciweavers

1798 search results - page 14 / 360
» A Tree for All Seasons
Sort
View
INFOCOM
2012
IEEE
11 years 10 months ago
On the construction of data aggregation tree with minimum energy cost in wireless sensor networks: NP-completeness and approxima
—In many applications, it is a basic operation for the sink to periodically collect reports from all sensors. Since the data gathering process usually proceeds for many rounds, i...
Tung-Wei Kuo, Ming-Jer Tsai
AAMAS
2012
Springer
12 years 3 months ago
Winner determination in voting trees with incomplete preferences and weighted votes
In multiagent settings where agents have different preferences, preference aggregation can be an important issue. Voting is a general method to aggregate preferences. We consider ...
Jérôme Lang, Maria Silvia Pini, Franc...
AAAI
2004
13 years 9 months ago
Tractable Tree Convex Constraint Networks
A binary constraint network is tree convex if we can construct a tree for the domain of the variables so that for any constraint, no matter what value one variable takes, all the ...
Yuanlin Zhang, Eugene C. Freuder
AAAI
1990
13 years 8 months ago
Tree Decomposition with Applications to Constraint Processing
This paper concerns the task of removing redundant information from a given knowledge base, and restructuring it in the form of a tree, so as to admit efficient problem solving ro...
Itay Meiri, Judea Pearl, Rina Dechter
CONSTRAINTS
2008
90views more  CONSTRAINTS 2008»
13 years 7 months ago
Combining Tree Partitioning, Precedence, and Incomparability Constraints
The tree constraint partitions a directed graph into node-disjoint trees. In many practical applications that involve such a partition, there exist side constraints specifying requ...
Nicolas Beldiceanu, Pierre Flener, Xavier Lorca