Sciweavers

464 search results - page 27 / 93
» Subsystem Based Generalizations of Rough Set Approximations
Sort
View
APPML
2006
84views more  APPML 2006»
14 years 9 months ago
Approximate deconvolution boundary conditions for large eddy simulation
We introduce new boundary conditions for Large Eddy Simulation. These boundary conditions are based on an approximate deconvolution approach. They are computationally efficient an...
Jeff Borggaard, T. Iliescu
COCO
2003
Springer
162views Algorithms» more  COCO 2003»
15 years 2 months 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
ATAL
2009
Springer
15 years 1 months ago
Improved approximation of interactive dynamic influence diagrams using discriminative model updates
Interactive dynamic influence diagrams (I-DIDs) are graphical models for sequential decision making in uncertain settings shared by other agents. Algorithms for solving I-DIDs fac...
Prashant Doshi, Yifeng Zeng
LWA
2008
14 years 11 months ago
Weighted Voting as Approximate MAP Prediction in Pairwise Classification
Weighted voting is the commonly used strategy for combining predictions in pairwise classification. Even though it shows excellent performance in practice, it is often criticized ...
Eyke Hüllermeier, Stijn Vanderlooy
CP
2008
Springer
14 years 11 months ago
A Soft Constraint of Equality: Complexity and Approximability
We introduce the SoftAllEqual global constraint, which maximizes the number of equalities holding between pairs of assignments to a set of variables. We study the computational com...
Emmanuel Hebrard, Barry O'Sullivan, Igor Razgon