Sciweavers

1963 search results - page 311 / 393
» The Maximum Solution Problem on Graphs
Sort
View
AAAI
2006
13 years 11 months ago
Solving MAP Exactly by Searching on Compiled Arithmetic Circuits
The MAP (maximum a posteriori hypothesis) problem in Bayesian networks is to find the most likely states of a set of variables given partial evidence on the complement of that set...
Jinbo Huang, Mark Chavira, Adnan Darwiche
NETWORKING
2004
13 years 11 months ago
Traffic Grooming in WDM Ring Networks with the Min-Max Objective
We consider the problem of traffic grooming in WDM ring networks. Previous studies have focused on minimizing aggregate representations of the network cost. In this work, we consid...
Bensong Chen, George N. Rouskas, Rudra Dutta
IJON
2007
100views more  IJON 2007»
13 years 10 months ago
Minimum range approach to blind partial simultaneous separation of bounded sources: Contrast and discriminacy properties
The blind source separation (BSS) problem is often solved by maximizing objective functions reflecting the statistical independence between outputs. Since global maximization may...
Frédéric Vrins, Dinh-Tuan Pham
TPDS
2008
167views more  TPDS 2008»
13 years 10 months ago
Algorithms for Fault-Tolerant Topology in Heterogeneous Wireless Sensor Networks
This paper addresses fault-tolerant topology control in a heterogeneous wireless sensor network consisting of several resource-rich supernodes, used for data relaying, and a large...
Mihaela Cardei, Shuhui Yang, Jie Wu
INFOCOM
2010
IEEE
13 years 8 months ago
Max-Contribution: On Optimal Resource Allocation in Delay Tolerant Networks
—This is by far the first paper considering joint optimization of link scheduling, routing and replication for disruption-tolerant networks (DTNs). The optimization problems for...
Kyunghan Lee, Yung Yi, Jaeseong Jeong, Hyungsuk Wo...