Sciweavers

2569 search results - page 173 / 514
» Approximate Objects and Approximate Theories
Sort
View
GRC
2007
IEEE
16 years 24 days ago
MGRS in Incomplete Information Systems
The original rough set model is concerned primarily with the approximation of sets described by single binary relation on the universe. In the view of granular computing, classica...
Yuhua Qian, Jiye Liang, Chuangyin Dang
ICCAD
1996
IEEE
86views Hardware» more  ICCAD 1996»
15 years 10 months ago
Tearing based automatic abstraction for CTL model checking
Based Automatic Abstraction for CTL Model Checking Woohyuk Lee Abelardo Pardo Jae-Young Jang Gary Hachtel Fabio Somenzi University of Colorado ECEN Campus Box 425 Boulder, CO, 8030...
Woohyuk Lee, Abelardo Pardo, Jae-Young Jang, Gary ...
ATAL
2006
Springer
15 years 10 months ago
Decentralized planning under uncertainty for teams of communicating agents
Decentralized partially observable Markov decision processes (DEC-POMDPs) form a general framework for planning for groups of cooperating agents that inhabit a stochastic and part...
Matthijs T. J. Spaan, Geoffrey J. Gordon, Nikos A....
DIALM
2008
ACM
135views Algorithms» more  DIALM 2008»
15 years 8 months ago
Symmetric range assignment with disjoint MST constraints
If V is a set of n points in the unit square [0, 1]2 , and if R : V + is an assignment of positive real numbers (radii) to to those points, define a graph G(R) as follows: {v, w}...
Eric Schmutz
NIPS
2007
15 years 8 months ago
Loop Series and Bethe Variational Bounds in Attractive Graphical Models
Variational methods are frequently used to approximate or bound the partition or likelihood function of a Markov random field. Methods based on mean field theory are guaranteed ...
Erik B. Sudderth, Martin J. Wainwright, Alan S. Wi...