2542 search results - page 205 / 509 » Computing Cartograms with Optimal Complexity |
ISMVL
1994
IEEE
15 years 4 months ago
1994
IEEE
The problem of approximating a propositional calculus is to nd many-valued logics which are sound for the calculus (i.e., all theorems of the calculus are tautologies) with as few...
107
click to vote
FCT
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. In recent years we have witnessed the proliferation of semidefinite programming bounds in combinatorial optimization [1,5,8], quantum computing [9,2,3,6,4,16] and even in...
130
Voted
AI
1999
Springer
15 years 12 days ago
1999
Springer
Cooperation among autonomous agents has been discussed in the DAI community for several years. Papers about cooperation 6,45 , negotiation 33 , distributed planning 5 , and coalit...
131
click to vote
JCC
2008
14 years 11 months ago
2008
: The prediction of the binding free energy between a ligand and a protein is an important component in the virtual screening and lead optimization of ligands for drug discovery. T...
127
click to vote
AAAI
2012
13 years 3 months ago
2012
Markov decision processes (MDPs) are an established framework for solving sequential decision-making problems under uncertainty. In this work, we propose a new method for batchmod...