Sciweavers

791 search results - page 91 / 159
» Approximating the Maximum Sharing Problem
Sort
View
AAAI
1998
13 years 9 months ago
Bayesian Network Models for Generation of Crisis Management Training Scenarios
We present a noisy-OR Bayesian network model for simulation-based training, and an efficient search-based algorithm for automatic synthesis of plausible training scenarios from co...
Eugene Grois, William H. Hsu, Mikhail Voloshin, Da...
IOR
2007
89views more  IOR 2007»
13 years 7 months ago
Fast, Fair, and Efficient Flows in Networks
Abstract. We study the problem of minimizing the maximum latency of flows in networks with congestion. We show that this problem is NP-hard, even when all arc latency functions ar...
José R. Correa, Andreas S. Schulz, Nicol&aa...
ESA
2009
Springer
92views Algorithms» more  ESA 2009»
14 years 2 months ago
Minimizing Movement: Fixed-Parameter Tractability
Abstract. We study an extensive class of movement minimization problems which arise from many practical scenarios but so far have little theoretical study. In general, these proble...
Erik D. Demaine, MohammadTaghi Hajiaghayi, D&aacut...
TSP
2010
13 years 2 months ago
Joint time synchronization and localization of an unknown node in wireless sensor networks
Abstract--Time synchronization and localization are two important issues in wireless sensor networks. Although these two problems share many aspects in common, they are traditional...
Jun Zheng, Yik-Chung Wu
COLT
2003
Springer
14 years 1 months ago
On Finding Large Conjunctive Clusters
We propose a new formulation of the clustering problem that differs from previous work in several aspects. First, the goal is to explicitly output a collection of simple and meani...
Nina Mishra, Dana Ron, Ram Swaminathan