Sciweavers

3367 search results - page 189 / 674
» Incremental assignment problem
Sort
View
129
Voted
UAI
1998
15 years 4 months ago
An Anytime Algorithm for Decision Making under Uncertainty
We present an anytime algorithm which computes policies for decision problems represented as multi-stage influence diagrams. Our algorithm constructs policies incrementally, start...
Michael C. Horsch, David Poole
132
Voted
MONET
2002
120views more  MONET 2002»
15 years 3 months ago
Energy-Efficient Broadcast and Multicast Trees in Wireless Networks
The wireless networking environment presents formidable challenges to the study of broadcasting and multicasting problems. In this paper we focus on the problem of multicast tree c...
Jeffrey E. Wieselthier, Gam D. Nguyen, Anthony Eph...
137
Voted
SIGCOMM
1997
ACM
15 years 7 months ago
Solutions to Hidden Terminal Problems in Wireless Networks
The floor acquisition multiple access (FAMA) discipline is analyzed in networks with hidden terminals. According to FAMA, control of the channel (the floor) is assigned to at mo...
Chane L. Fullmer, J. J. Garcia-Luna-Aceves
146
Voted
CVPR
2012
IEEE
13 years 5 months ago
What is optimized in tight convex relaxations for multi-label problems?
In this work we present a unified view on Markov random fields and recently proposed continuous tight convex relaxations for multi-label assignment in the image plane. These rel...
Christopher Zach, Christian Hane, Marc Pollefeys
ALGORITHMICA
2010
192views more  ALGORITHMICA 2010»
15 years 3 months ago
Circular Stable Matching and 3-way Kidney Transplant
We consider the following version of the stable matching problem. Suppose that men have preferences for women, women have preferences for dogs, and dogs have preferences for men. T...
Chien-Chung Huang