default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDISAIM 2012: Fort Lauderdale, Florida, USA
- International Symposium on Artificial Intelligence and Mathematics, ISAIM 2012, Fort Lauderdale, Florida, USA, January 9-11, 2012. 2012
Regular Track
- Nhan-Tam Nguyen, Magnus Roos, Jörg Rothe:
Exact Optimization of Social Welfare by the Nash Product is DP-Complete. - Xia Qu, Prashant Doshi, Adam Goodie:
Modeling Deep Strategic Reasoning by Humans in Competitive Games. - Yishay Mansour, Mariano Schain:
Robust Domain Adaptation. - Hans Ulrich Simon:
PAC-Learning in the Presence of One-sided Classification Noise. - Imen Boukhris, Zied Elouedi, Salem Benferhat:
From Acceptation Relations to Causality Ascription in a Belief Function Framework. - Pavlos Eirinakis, Salvatore Ruggieri, K. Subramani, Piotr Wojciechowski:
Computational complexity of inclusion queries over polyhedral sets. - Marco Gavanelli, Fabrizio Riguzzi, Michela Milano, Paolo Cagnoli:
Constraint and Optimization techniques for supporting Policy Making. - Venkatesh Ramamoorthy, Marius Silaghi, Toshihiro Matsui, Katsutoshi Hirayama, Makoto Yokoo:
Soft Nonlinearity Constraints and their Lower-Arity Decomposition. - Achref El Mouelhi, Philippe Jégou, Cyril Terrioux, Bruno Zanuttini:
On the Efficiency of Backtracking Algorithms for Binary Constraint Satisfaction Problems. - Shai Ben-David, Shai Shalev-Shwartz, Ruth Urner:
Domain Adaptation--Can Quantity compensate for Quality?. - Ekhlas Sonu, Prashant Doshi:
Generalized and Bounded Policy Iteration for Interactive POMDPs. - Arindam Khaled, Changhe Yuan, Eric A. Hansen:
Solving Limited Memory Influence Diagrams Using Branch-and-Bound Search. - Hei Chan, Manabu Kuroki:
Identification of Causal Effects in Linear SEMs using the Instrumental Variable Function. - Cynthia Rudin, Theja Tulabandhula:
The Influence of Operational Cost on Estimation. - Aritanan Gruber, Endre Boros:
Hardness Results for Approximate Pure Horn CNF Formulae Minimization.
Special session on Boolean and pseudo-Boolean Functions
Special Classes
- Claude Carlet, Sihem Mesnager:
On Dillon's class H of Niho bent functions and o-polynomials. - Endre Boros, Aritanan Gruber:
On quadratization of pseudo-Boolean functions. - Jan-Georg Smaus, Christian Schilling, Fabian Wenzelmann:
Implementations of two algorithms for the threshold synthesis problem.
Boolean Structures
- Václav Vlcek, Tomás Balyo, Stefan Gurský, Petr Kucera:
On hierarchies over the SLUR class. - Ondrej Cepek, Petr Kucera, Stanislav Kurik:
Boolean functions with long prime implicants. - Utz-Uwe Haus, Elke Eisenschmidt:
Bi-tone and k-tone decompositions of Boolean functions.
Data Mining
- Munevver Mine Subasi, Peter L. Hammer, Ersoy Subasi, Martin Anthony:
A new imputation method for incomplete binary data. - Giovanni Felici, Emanuel Weitschek:
Mining logic models in the presence of noisy data. - Martin Anthony, Joel Ratsaby:
The performance of a new hybrid classifier based on boxes and nearest neighbors.
Representations
- Lisa Hellerstein, Devorah Kletenik:
On the gap between ess(f) and cnf_size(f). - Despina Stasi, Robert H. Sloan, György Turán:
Hydra formulas and directed hypergraphs: A preliminary report. - Kira V. Adaricheva, James B. Nation, Robert Rand:
Ordered direct implicational basis of a finite closure system.
Special Session on Computational Social Choice
- Gizem Karaali, Sinan Aksoy, Adam Azzam, Chaya Coppersmith, Julie Glass, Xueying Zhao, Xinjing Zhu:
A Cost-Minimizing Algorithm for School Choice. - Lirong Xia, Vincent Conitzer:
Approximating Common Voting Rules by Sequential Voting in Multi-Issue Domains. - Nicholas Mattei, Maria Silvia Pini, Francesca Rossi, Kristen Brent Venable:
Bribery in Voting Over Combinatorial Domains Is Easy. - Trung Thanh Nguyen, Magnus Roos, Jörg Rothe:
A Survey of Approximability and Inapproximability Results for Social Welfare Optimization in Multiagent Resource Allocation. - Michel Regenwetter, Bernard Grofman, Anna Popova, William Messner, Clintin P. Davis-Stober, Daniel R. Cavagnaro:
Behavioural social choice: a status report. - Jörg Rothe, Lena Schend:
Typical-Case Challenges to Complexity Shields That Are Supposed to Protect Elections Against Manipulation and Control: A Survey. - T. Nicolaus Tideman, Florenz Plassmann:
Developing the Empirical Side of Computational Social Choice.
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-12-03 20:34 CET 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:
