Остановите войну!
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 730 matches
- 2011
- Can Baskent:
Homotopies in Classical and Paraconsistent Modal Logics. CoRR abs/1107.4932 (2011) - Dorota Lipowska, Adam Lipowski:
Naming Game on Adaptive Weighted Networks. CoRR abs/1107.3263 (2011) - Ian D. Morris, Nikita Sidorov:
On a Devil's staircase associated to the joint spectral radii of a family of pairs of matrices. CoRR abs/1107.3506 (2011) - Kundan Singh, Carol Davids:
Flash-based Audio and Video Communication in the Cloud. CoRR abs/1107.0011 (2011) - Jitesh Dundas:
Automaton based detection of affected cells in three dimensional biological system. CoRR abs/1107.0015 (2011) - Ahmed Al-Ani, Mohamed A. Deriche:
A New Technique for Combining Multiple Classifiers using The Dempster-Shafer Theory of Evidence. CoRR abs/1107.0018 (2011) - Silvia Acid, Luis M. de Campos:
Searching for Bayesian Network Structures in the Space of Restricted Acyclic Partially Directed Graphs. CoRR abs/1107.0019 (2011) - Orna Grumberg, Shlomi Livne, Shaul Markovitch:
Learning to Order BDD Variables in Verification. CoRR abs/1107.0020 (2011) - William E. Walsh, Michael P. Wellman:
Decentralized Supply Chain Formation: A Market Protocol and Competitive Equilibrium Analysis. CoRR abs/1107.0021 (2011) - Dov Monderer, Moshe Tennenholtz:
K-Implementation. CoRR abs/1107.0022 (2011) - Craig Boutilier, Ronen I. Brafman, Carmel Domshlak, Holger H. Hoos, David Poole:
CP-nets: A Tool for Representing and Reasoning withConditional Ceteris Paribus Preference Statements. CoRR abs/1107.0023 (2011) - Adnan Darwiche, James D. Park:
Complexity Results and Approximation Strategies for MAP Explanations. CoRR abs/1107.0024 (2011) - Stefan Edelkamp:
Taming Numbers and Durations in the Model Checking Integrated Planning System. CoRR abs/1107.0025 (2011) - Mark-Jan Nederhof, Giorgio Satta:
IDL-Expressions: A Formalism for Representing and Parsing Finite Languages in Natural Language Processing. CoRR abs/1107.0026 (2011) - Tomas Kocka, Nevin Lianwen Zhang:
Effective Dimensions of Hierarchical Latent Class Models. CoRR abs/1107.0027 (2011) - Moshe Babaioff, Noam Nisan:
Concurrent Auctions Across The Supply Chain. CoRR abs/1107.0028 (2011) - Mehmet H. Göker, Pat Langley, Cynthia A. Thompson:
A Personalized System for Conversational Recommendations. CoRR abs/1107.0029 (2011) - Ofer Arieli, Maurice Bruynooghe, Marc Denecker, Bert Van Nuffelen:
Coherent Integration of Databases by Abductive Logic Programming. CoRR abs/1107.0030 (2011) - Peter Gorniak, Deb Roy:
Grounded Semantic Composition for Visual Scenes. CoRR abs/1107.0031 (2011) - Michael H. Bowling, Manuela M. Veloso:
Existence of Multiagent Equilibria with Limited Agents. CoRR abs/1107.0033 (2011) - Kevin M. Lochner, Daniel M. Reeves, Yevgeniy Vorobeychik, Michael P. Wellman:
Price Prediction in a Trading Agent Competition. CoRR abs/1107.0034 (2011) - Jeroen Keppens, Qiang Shen:
Compositional Model Repositories via Dynamic Constraint Satisfaction with Order-of-Magnitude Preferences. CoRR abs/1107.0035 (2011) - Allan Borodin, Ran El-Yaniv, Vincent Gogan:
Can We Learn to Beat the Best Stock. CoRR abs/1107.0036 (2011) - Risto Miikkulainen, Kenneth O. Stanley:
Competitive Coevolution through Evolutionary Complexification. CoRR abs/1107.0037 (2011) - Brahim Hnich, Barbara M. Smith, Toby Walsh:
Dual Modelling of Permutation and Injection Problems. CoRR abs/1107.0038 (2011) - Heidi E. Dixon, Matthew L. Ginsberg, Andrew J. Parkes:
Generalizing Boolean Satisfiability I: Background and Survey of Existing Work. CoRR abs/1107.0040 (2011) - Asaph Ben-Yair, Ariel Felner, Sarit Kraus, Nathan S. Netanyahu, Roni Stern:
PHA*: Finding the Shortest Path with A* in An Unknown Physical Environment. CoRR abs/1107.0041 (2011) - Nevin Lianwen Zhang, Weihong Zhang:
Restricted Value Iteration: Theory and Algorithms. CoRR abs/1107.0042 (2011) - David A. Cohen, Martin C. Cooper, Peter Jeavons, Andrei A. Krokhin:
A Maximal Tractable Class of Soft Constraints. CoRR abs/1107.0043 (2011) - Paul Beame, Henry A. Kautz, Ashish Sabharwal:
Towards Understanding and Harnessing the Potential of Clause Learning. CoRR abs/1107.0044 (2011)
skipping 700 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-06-04 06:59 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