Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDISAIM 2016: Fort Lauderdale, FL, USA
- International Symposium on Artificial Intelligence and Mathematics, ISAIM 2016, Fort Lauderdale, Florida, USA, January 4-6, 2016. 2016
Regular Track
- Piotr Wojciechowski, K. Subramani, Pavlos Eirinakis:
On the computational complexities of Quantified Integer Programming variants. - Salem Benferhat, Amen Ajroud:
Computing multiple c-revision using OCF knowledge base. - Christian Reger:
Voter Control in k-Approval and k-Veto under Partial Information. - Steven D. Prestwich, Armagan Tarim, Ibrahim Özkan:
Causal Discovery by Randomness Test. - Cynthia Maushagen, Jörg Rothe:
Complexity of Control by Partitioning Veto and Maximin Elections. - Abdelhamid Boudjelida, Salem Benferhat:
Conjunctive Choice Logic. - Kahina Bouchama, Mohammed Said Radjef, Lakhdar Sais:
Z-Equilibrium For a CSP Game. - Jussi Määttä, Teemu Roos:
Robust Sequential Prediction in Linear Regression with Student's t-distribution. - Markus Brill, Vincent Conitzer, Rupert Freeman, Nisarg Shah:
False-Name-Proof Recommendations in Social Networks. - Vincent Conitzer, Rupert Freeman, Markus Brill, Yuqian Li:
Rules for Choosing Societal Tradeoffs. - Markus Brill, Rupert Freeman, Vincent Conitzer:
Computing Possible and Necessary Equilibrium Actions (and Bipartisan Set Winners). - Roman Barták, Jindrich Vodrázka:
The Effect of Domain Modeling on Efficiency of Planning. - Benjamin Fish, Yi Huang, Lev Reyzin:
Recovering Social Networks by Observing Votes. - T. K. Satish Kumar:
Kernelization, Generation of Bounds, and the Scope of Incremental Computation for Weighted Constraint Satisfaction Problems. - Yali Wan, Marina Meila:
Benchmarking recovery theorems for the DC-SBM. - Chao Lan, Xiaoli Li, Yujie Deng, Jun Huan:
Partial Collective Matrix Factorization and its PAC Bound. - Junkyu Lee, Radu Marinescu, Rina Dechter:
Applying Search Based Probabilistic Inference Algorithms to Probabilistic Conformant Planning: Preliminary Results. - Esma Balkir, Dimitri Kartsaklis, Mehrnoosh Sadrzadeh:
Sentence Entailment in Compositional Distributional Semantics.
Special session on Boolean and pseudo-Boolean Functions
- Munevver Mine Subasi, Melissa S. Moreno, Travaughn C. Bain, Megan Moreno, Ersoy Subasi, Katherine C. Carroll, Emily R. Cunningham, Michael Lipkowitz:
Pattern-based Classification and Survival Analysis of Chronic Kidney Disease. - Ersoy Subasi, Munevver Mine Subasi, Michael Lipkowitz, John Roboz, Peter L. Hammer:
A Classification Model to Predict the Rate of Decline of Kidney Function. - Petr Savický, Petr Kucera:
Generating models of a matched formula with a polynomial delay. - Munevver Mine Subasi, Juan Felix Avila Herrera:
Logical Analysis of Multiclass Data. - Ondrej Cepek, Radek Husek:
Knowledge compilation from DNF to switch-list representations. - Eric Bach, Lisa Hellerstein, Devorah Kletenik:
On the Goal Value of a Boolean Function. - Endre Boros, Ondrej Cepek, Kazuhisa Makino:
A combinatorial min-max theorem and minimization of pure-Horn functions. - Ryan Berryhill, Andreas G. Veneris:
Efficient Selection of Suspect Sets in Unreachable State Diagnosis. - Eric William Davis Rozier, Kristin Y. Rozier:
Cascading Solution to Data Dependence Constraints with Z3. - Miroslav N. Velev, Ping Gao:
Application of Hierarchical Hybrid Encodings to Solve CSPs as Equivalent SAT Problems.
Special session on Computational Approaches to Proof Construction
- Leonardo de Moura:
Formalizing Mathematics using the Lean Theorem Prover. - Josef Urban:
Learning Intelligent Theorem Proving from Large Formal Corpora. - Ilias S. Kotsireas:
Computational Approaches to Open Problems in Combinatorics.
Special session on Integrating Constraint Programming and Operations Research
- Bernard Gendron, Louis-Martin Rousseau:
Grammar-Based Integer Programming Models and Methods for Employee Scheduling Problems. - Domenico Salvagnin:
Detecting and Exploiting Global Structures in MIP. - Laurent Michel, Daniel Fontaine:
Model Combinators in the Scheduling Domain. - Michael Winkler:
Solving Non-Linear Pseudo-Boolean Optimization Problems by Constraint Integer Programming. - André A. Ciré:
Hybrid Approaches Based on Lagrangian Relaxation. - David Bergman:
Decompositions Based on Decision Diagrams. - Stathis Plitsos, Dimitrios Magos, Ioannis Mourtos:
An Integrated Solver for Multi-index Assignment. - Kyle E. C. Booth, Tony T. Tran, J. Christopher Beck:
Decomposition Methods for the Travelling Purchaser Problem. - Aliza Heching, John N. Hooker:
Logic-Based Benders Decomposition for Multiagent Scheduling with Sequence-dependent Costs.
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-05-05 01:12 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
