Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDISAIM 2020: Fort Lauderdale, FL, USA
- International Symposium on Artificial Intelligence and Mathematics, ISAIM 2020, Fort Lauderdale, Florida, USA, January 6-8, 2020. 2018
Regular Track
- Christian Komo, Christoph Beierle:
Upper and lower bounds for finite domain constraints to realize skeptical inference over conditional knowledge bases. - Jingchao Chen:
Fast Verifying Proofs of Propositional Unsatisfiability via Window Shifting. - Dimitrios I. Diochnos, Saeed Mahloujifar, Mohammad Mahmoody:
Lower Bounds for Adversarially Robust PAC Learning. - Thiago Serra, Srikumar Ramalingam:
Empirical Bounds on Linear Regions of Deep Rectifier Networks. - Julien Vion, René Mandiau, Sylvain Piechowiak, Marius Silaghi:
Privacy for the Distributed Stochastic Algorithm with Breakouts. - Satoru Watanabe, Hayato Yamana:
Topological Measurement of Deep Neural Networks Using Persistent Homology. - Marc Neveling, Jörg Rothe, Roman Zorn:
The Complexity of Controlling Condorcet, Fallback, and k-Veto Elections by Replacing Candidates or Voters. - Daya Ram Gaur, Muhammad Khan:
Testing Unsatisfiability of Constraint Satisfaction Problems via Tensor Products. - Anna Maria Kerkmann, Jörg Rothe:
Altruism in Coalition Formation Games. - Bjørn Kjos-Hanssen, Clyde James Felix, Sun Young Kim, Ethan Lamb, Davin Takahashi:
VC-dimensions of nondeterministic finite automata for words of equal length. - K. Subramani, Piotr Wojciechowski:
Finding read-once refutations in 2CNF formulas and variants - a parameterized perspective. - Theja Tulabandhula, Yunjuan Wang:
Making Recommendations when Users Experience Fatigue. - Hong Xu, Kexuan Sun, Sven Koenig, Itay Hen, T. K. Satish Kumar:
Hybrid Quantum-Classical Algorithms for Solving the Weighted CSP. - Sihem Belabbes, Salem Benferhat:
Partially Preordered Inconsistent Lightweight Ontologies in Possibility Theory. - Karine Chubarian, György Turán:
Interpretability of Bayesian Network Classifiers: OBDD Approximation and Polynomial Threshold Functions.
Special Session on Applications of AI/Robotics to Agriculture
- Jaafar Abdulridha, Yiannis Ampatzidis, Pamela Roberts, Sri Charan Kakarla:
Detecting and monitoring the progress of powdery mildew disease in squash using hyperspectral imaging and artificial neural networks. - Hao Gan, Won Suk Lee, Natalia Peres, Clyde W. Fraisse:
Development of A Multi-Angle Imaging System for Automatic Strawberry Flower Counting. - Leon Nunes, Yiannis Ampatzidis, Lucas Costa, Marcelo Wallau:
Horse foraging behavior detection using Recurrent Neural Networks. - Victor Partel, Jinho Kim, Lucas Costa, Panos M. Pardalos, Yiannis Ampatzidis:
Smart Sprayer for Precision Weed Control Using Artificial Intelligence: Comparison of Deep Learning Frameworks. - Mohammad Valipour, Sandra M. Guzmán, Mohammad Ali Gholami Sefidkouhi, Mahmoud Raeini-Sarjaz:
Using Genetic Algorithms and Gene Expression Programming to Estimate Evapotranspiration with Limited Meteorological Data.
Special Session on Boolean and pseudo-Boolean Functions
- Kristóf Bérczi, Endre Boros, Ondrej Cepek, Petr Kucera, Kazuhisa Makino:
Approximating minimum representations of key Horn functions. - Jinwook Lee, András Prékopa:
On the conditional expectation given Boolean functions of events in the n-space. - Petr Kucera, Petr Savický:
On the size of CNF formulas with high propagation strength. - Milos Chromý, Ondrej Cepek:
Compiling SL representations of Boolean functions into OBDDs. - Richard Ostrowski, Lionel Paris, Adrien Varet:
Another Way to Browse the Search Space For Some Transformations from CSP to SAT. - Joonhee Lee, Endre Boros:
Bounds for the Probability of the Union of Events.
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-07-06 23:29 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:
