Sciweavers

3758 search results - page 596 / 752
» A Complete Subsumption Algorithm
Sort
View
GECCO
2010
Springer
169views Optimization» more  GECCO 2010»
15 years 1 months ago
Robust symbolic regression with affine arithmetic
We use affine arithmetic to improve both the performance and the robustness of genetic programming for symbolic regression. During evolution, we use affine arithmetic to analyze e...
Cassio Pennachin, Moshe Looks, João A. de V...
CSE
2009
IEEE
15 years 1 months ago
Extended Dempster-Shafer Theory in Context Reasoning for Ubiquitous Computing Environments
—Context, the pieces of information that capture the characteristics of ubiquitous computing environment, is often imprecise and incomplete due to user mobility, unreliable wirel...
Daqiang Zhang, Jiannong Cao, Jingyu Zhou, Minyi Gu...
AAAI
2008
15 years 10 days ago
A General Framework for Generating Multivariate Explanations in Bayesian Networks
Many existing explanation methods in Bayesian networks, such as Maximum a Posteriori (MAP) assignment and Most Probable Explanation (MPE), generate complete assignments for target...
Changhe Yuan, Tsai-Ching Lu
DLOG
2007
15 years 10 days ago
Integrated Distributed Description Logics
In the context of the Semantic Web or semantic peer to peer systems, many ontologies may exist and be developed independently. Ontology alignments help integrating, mediating or re...
Antoine Zimmermann
NSDI
2007
15 years 10 days ago
Beyond One-Third Faulty Replicas in Byzantine Fault Tolerant Systems
Byzantine fault tolerant systems behave correctly when no more than f out of 3f + 1 replicas fail. When there are more than f failures, traditional BFT protocols make no guarantee...
Jinyuan Li, David Mazières