Sciweavers

4679 search results - page 397 / 936
» Modeling When Connections Are the Problem
Sort
View
COCO
2003
Springer
162views Algorithms» more  COCO 2003»
16 years 8 hour ago
Near-Optimal Lower Bounds on the Multi-Party Communication Complexity of Set Disjointness
We study the communication complexity of the set disjointness problem in the general multi-party model. For t players, each holding a subset of a universe of size n, we establish ...
Amit Chakrabarti, Subhash Khot, Xiaodong Sun
ICAI
2010
15 years 4 months ago
Exact Loopy Belief Propagation on Euler Graphs
Belief propagation is widely used in inference of graphical models. It yields exact solutions when the underlying graph is singly connected. When the graph contains loops, double-c...
Chen-Hsiang Yeang
ASMTA
2009
Springer
114views Mathematics» more  ASMTA 2009»
15 years 10 months ago
Improving the Efficiency of the Proxel Method by Using Individual Time Steps
Discrete stochastic models (DSM) are widely used in various application fields today. Proxel-based simulation can outperform discrete event-based approaches in the analysis of smal...
Claudia Krull, Robert Buchholz, Graham Horton
WSC
2008
15 years 9 months ago
Simulation optimization for industrial scheduling using hybrid genetic representation
Simulation modeling has the capability to represent complex real-world systems in details and therefore it is suitable to develop simulation models for generating detailed operati...
Marcus Andersson, Amos Ng, Henrik Grimm
ICDCS
2010
IEEE
15 years 7 months ago
Link-Centric Probabilistic Coverage Model for Transceiver-Free Object Detection in Wireless Networks
Abstract--Sensing coverage is essential for most applications in wireless networks. In traditional coverage problem study, the disk coverage model has been widely applied because o...
Dian Zhang, Yunhuai Liu, Lionel M. Ni