2266 search results - page 331 / 454 » Evolutionary Algorithms for the Satisfiability Problem |
140
click to vote
APPROX
2008
Springer
15 years 5 months ago
2008
Springer
In the Survivable Network Design Problem (SNDP) one seeks to find a minimum cost subgraph that satisfies prescribed node-connectivity requirements. We give a novel approximation r...
133
Voted
AAAI
2006
15 years 5 months ago
2006
Intelligent agents must be able to handle the complexity and uncertainty of the real world. Logical AI has focused mainly on the former, and statistical AI on the latter. Markov l...
143
Voted
ICML
2010
IEEE
15 years 4 months ago
2010
IEEE
Multiagent Inductive Learning is the problem that groups of agents face when they want to perform inductive learning, but the data of interest is distributed among them. This pape...
114
click to vote
CSL
2002
Springer
15 years 3 months ago
2002
Springer
A propositional proof system is automatizable if there is an algorithm that, given a tautology, produces a proof in time polynomial in the size of its smallest proof. This notion ...
131
click to vote
ICTAI
2009
IEEE
15 years 1 months ago
2009
IEEE
We address the problem of merging qualitative constraints networks (QCNs). We point out a merging algorithm which computes a consistent QCN representing a global view of the input...