Sciweavers

1278 search results - page 71 / 256
» The Complexity of Weighted Boolean
Sort
View
IJCAI
2007
13 years 10 months ago
Counting Complexity of Propositional Abduction
Abduction is an important method of non-monotonic reasoning with many applications in artificial intelligence and related topics. In this paper, we concentrate on propositional ab...
Miki Hermann, Reinhard Pichler
IROS
2007
IEEE
175views Robotics» more  IROS 2007»
14 years 3 months ago
Simulation and weights of multiple cues for robust object recognition
Reliable recognition of objects is an important capabaility in the progress towards getting agents to accomplish and assist in a variety of useful tasks such as search and rescue ...
Sarah Aboutalib, Manuela M. Veloso
CSB
2005
IEEE
189views Bioinformatics» more  CSB 2005»
14 years 2 months ago
Learning Yeast Gene Functions from Heterogeneous Sources of Data Using Hybrid Weighted Bayesian Networks
We developed a machine learning system for determining gene functions from heterogeneous sources of data sets using a Weighted Naive Bayesian Network (WNB). The knowledge of gene ...
Xutao Deng, Huimin Geng, Hesham H. Ali
AAMAS
2012
Springer
12 years 4 months ago
Winner determination in voting trees with incomplete preferences and weighted votes
In multiagent settings where agents have different preferences, preference aggregation can be an important issue. Voting is a general method to aggregate preferences. We consider ...
Jérôme Lang, Maria Silvia Pini, Franc...
WADS
2007
Springer
104views Algorithms» more  WADS 2007»
14 years 3 months ago
Faster Approximation of Distances in Graphs
Let G = (V, E) be an weighted undirected graph on n vertices and m edges, and let dG be its shortest path metric. We present two simple deterministic algorithms for approximating ...
Piotr Berman, Shiva Prasad Kasiviswanathan