Sciweavers

3455 search results - page 248 / 691
» Generalized Game Trees
Sort
View
IOR
2008
148views more  IOR 2008»
15 years 7 months ago
A Game-Theoretic Approach to Efficient Power Management in Sensor Networks
Wireless sensor networks pose numerous fundamental coordination problems. For instance, in a number of application domains including homeland security, environmental monitoring an...
Enrique Campos-Náñez, Alfredo Garcia...
AAMAS
2012
Springer
14 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...
ICCV
2005
IEEE
16 years 9 months ago
Probabilistic Boosting-Tree: Learning Discriminative Models for Classification, Recognition, and Clustering
In this paper, a new learning framework?probabilistic boosting-tree (PBT), is proposed for learning two-class and multi-class discriminative models. In the learning stage, the pro...
Zhuowen Tu
STOC
2005
ACM
115views Algorithms» more  STOC 2005»
16 years 7 months ago
Lower-stretch spanning trees
We show that every weighted connected graph G contains as a subgraph a spanning tree into which the edges of G can be embedded with average stretch O log2 n log log n . Moreover, w...
Michael Elkin, Yuval Emek, Daniel A. Spielman, Sha...
SOFSEM
2007
Springer
16 years 1 months ago
Competitive Maintenance of Minimum Spanning Trees in Dynamic Graphs
Abstract. We consider the problem of maintaining a minimum spanning tree within a graph with dynamically changing edge weights. An online algorithm is confronted with an input sequ...
Miroslaw Dynia, Miroslaw Korzeniowski, Jaroslaw Ku...