Остановите войну!
for scientists:
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 52 matches
- 2018
- Liron Cohen, Tansel Uras, Shiva Jahangiri, Aliyah Arunasalam, Sven Koenig, T. K. Satish Kumar:
The FastMap Algorithm for Shortest Path Computations. ISAIM 2018 - Hong Xu, Kexuan Sun, Sven Koenig, T. K. Satish Kumar:
A Warning Propagation-Based Linear-Time-and-Space Algorithm for the Minimum Vertex Cover Problem on Giant Graphs. ISAIM 2018 - Hong Xu, Xin-Zeng Wu, Cheng Cheng, Sven Koenig, T. K. Satish Kumar:
The Buss Reduction for the k-Weighted Vertex Cover Problem. ISAIM 2018 - Karim T. Abou-Moustafa, Csaba Szepesvári:
An Exponential Tail Bound for Lq Stable Learning Rules. Application to k-Folds Cross-Validation. ISAIM 2018 - Morteza Ashraphijuo, Xiaodong Wang:
A Characterization of Sampling Patterns for Union of Low-Rank Subspaces Retrieval Problem. ISAIM 2018 - Travaughn C. Bain, Juan Felix Avila Herrera, Ersoy Subasi, Munevver Mine Subasi:
Logical Analysis of Multiclass Data with Relaxed Patterns. ISAIM 2018 - Kevin Baum, Holger Hermanns, Timo Speith:
From Machine Ethics To Machine Explainability and Back. ISAIM 2018 - Bahram Behzadian, Marek Petrik:
Low-rank Feature Selection for Reinforcement Learning. ISAIM 2018 - Oliver Bendel:
Selected Prototypes of Moral Machines. ISAIM 2018 - Martin Mose Bentzen:
A Formalization of Kant's Second Formulation of the Categorical Imperative. ISAIM 2018 - Patrice Bertail, Gabriela Ciolek, Stéphan Clémençon:
Generalization Bounds for Minimum Volume Set Estimation based on Markovian Data. ISAIM 2018 - Endre Boros, Yves Crama, Elisabeth Rodríguez-Heck:
Quadratizations of symmetric pseudo-Boolean functions: sub-linear bounds on the number of auxiliary variables. ISAIM 2018 - Stephen D. Boyles:
Parking search equilibrium and its implications for parking management. ISAIM 2018 - Selmer Bringsjord, Naveen Sundar G., Bertram F. Malle, Matthias Scheutz:
Contextual Deontic Cognitive Event Calculi for Ethically Correct Robots. ISAIM 2018 - Hamid Mirzaei Buini, Guni Sharon, Stephen D. Boyles, Tony Givargis, Peter Stone:
Enhanced Delta-tolling: Traffic Optimization via Policy Gradient Reinforcement Learning. ISAIM 2018 - Vincent Conitzer, Walter Sinnott-Armstrong, Jana Schaich Borg, Yuan Deng, Max Kramer:
Moral Decision Making Frameworks for Artificial Intelligence. ISAIM 2018 - Yahel David, Balázs Szörényi, Mohammad Ghavamzadeh, Shie Mannor, Nahum Shimkin:
PAC Bandits with Risk Constraints. ISAIM 2018 - Wejdan Deebani, Nezamoddin Nezamoddini-Kachouie:
Ensemble Correlation Coefficient. ISAIM 2018 - Louise A. Dennis, Michael Fisher:
Practical Challenges in Explicit Ethical Machine Reasoning. ISAIM 2018 - Dimitrios I. Diochnos:
On the Evolvability of Monotone Monomials with a (1+1) Evolutionary Algorithm. ISAIM 2018 - Christian J. Feldbacher-Escamilla, Gerhard Schurz:
Meta-inductive Probability Aggregation and Optimal Scoring. ISAIM 2018 - Ferdinando Fioretto, Hong Xu, Sven Koenig, T. K. Satish Kumar:
Constraint Composite Graph-Based Lifted Message Passing for Distributed Constraint Optimization Problems. ISAIM 2018 - Benjamin Fish, Lev Reyzin, Benjamin I. P. Rubinstein:
Sublinear-Time Adaptive Data Analysis. ISAIM 2018 - John Franco:
A Peek at the Cryptol Language. ISAIM 2018 - Paolo Giuliodori, Stefano Bistarelli, Dimitri Mugnai:
A Fair Payment Scheme for Virtuous Community Energy Usage. ISAIM 2018 - Naveen Sundar Govindarajulu, Rikhiya Ghosh, Selmer Bringsjord:
Extending Formal Models of the Doctrine of Double Effect with Emotions. ISAIM 2018 - Jianding Guo, Laurent Moalic, Jean-Noël Martin, Alexandre Caminada:
Exact Graph Coloring Algorithms of Getting Partial and All Best Solutions. ISAIM 2018 - Ghassen Hamdi, Mohamed Nazih Omri, Odile Papini, Salem Benferhat, Zied Bouraoui:
Querying DL-lite Knowledge Bases from Hidden Datasets. ISAIM 2018 - Lisa Hellerstein:
Stochastic Evaluation of Symmetric Boolean Functions. ISAIM 2018 - John N. Hooker:
Dynamic Programming Bounds from Decision Diagrams. ISAIM 2018
skipping 22 more matches
loading more results
failed to load more results, please try again later
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-05-23 20:46 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint