Остановите войну!
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 815 matches
- 2011
- Sergey G. Bobkov, Mokshay M. Madiman:
On the problem of reversibility of the entropy power inequality. CoRR abs/1111.6807 (2011) - Silvère Bonnabel:
Stochastic gradient descent on Riemannian manifolds. CoRR abs/1111.5280 (2011) - André Chailloux, Or Sattath:
The Complexity of the Separable Hamiltonian Problem. CoRR abs/1111.5247 (2011) - Youngmi Hur, Fang Zheng:
Coset Sum: an alternative to the tensor product in wavelet construction. CoRR abs/1111.5092 (2011) - Akihiro Munemasa, Yoshio Sano, Tetsuji Taniguchi:
Fat Hoffman graphs with smallest eigenvalue at least $-1-τ$. CoRR abs/1111.7284 (2011) - Christoph Räth, M. Gliozzi, I. E. Papadakis, W. Brinkmann:
Revisiting algorithms for generating surrogate time series. CoRR abs/1111.1414 (2011) - Yoshio Sano:
On the rank functions of $\mathcal{H}$-matroids. CoRR abs/1111.2642 (2011) - John H. Seago, Robert L. Seaman, Steven L. Allen:
The Colloquium on Decoupling Civil Timekeeping from Earth Rotation. CoRR abs/1111.7007 (2011) - Parikshit Shah, Pablo A. Parrilo:
An Optimal Controller Architecture for Poset-Causal Systems. CoRR abs/1111.7221 (2011) - Aman Chadha, Divya Jyoti, M. Mani Roja:
Text-Independent Speaker Recognition for Low SNR Environments with Encryption. CoRR abs/1111.0024 (2011) - Hang-Hyun Jo, Eunyoung Moon, Kimmo Kaski:
Optimized reduction of uncertainty in bursty human dynamics. CoRR abs/1111.0033 (2011) - Jianshu Chen, Ali H. Sayed:
Diffusion Adaptation Strategies for Distributed Optimization and Learning over Networks. CoRR abs/1111.0034 (2011) - Ian Horrocks, Jeff Z. Pan, Giorgos B. Stamou, Giorgos Stoilos, Vassilis Tzouvaras:
Reasoning with Very Expressive Fuzzy Description Logics. CoRR abs/1111.0039 (2011) - Chu Min Li, Felip Manyà, Jordi Planes:
New Inference Rules for Max-SAT. CoRR abs/1111.0040 (2011) - Rafael H. Bordini, Álvaro F. Moreira, Renata Vieira, Michael J. Wooldridge:
On the Formal Semantics of Speech-Act Based Communication in an Agent-Oriented Programming Language. CoRR abs/1111.0041 (2011) - Boi Faltings, Radu Jurca:
Obtaining Reliable Feedback for Sanctioning Reputation Mechanisms. CoRR abs/1111.0043 (2011) - Carmel Domshlak, Jörg Hoffmann:
Probabilistic Planning via Heuristic Forward Search and Weighted Model Counting. CoRR abs/1111.0044 (2011) - Indrajit Bhattacharya, Lise Getoor:
Query-time Entity Resolution. CoRR abs/1111.0045 (2011) - Jonathan Bredin, Quang Duong, David C. Parkes:
Chain: A Dynamic Double Auction Framework for Matching Patient Agents. CoRR abs/1111.0046 (2011) - François Mairesse, Rashmi Prasad, Amanda Stent, Marilyn A. Walker:
Individual and Domain Adaptation in Sentence Planning for Dialogue. CoRR abs/1111.0048 (2011) - Birte Glimm, Ian Horrocks, Carsten Lutz, Ulrike Sattler:
Conjunctive Query Answering for the Description Logic SHIQ. CoRR abs/1111.0049 (2011) - George Macleod Coghill, Ross D. King, Ashwin Srinivasan:
Qualitative System Identification from Imperfect Data. CoRR abs/1111.0051 (2011) - Malcolm R. K. Ryan:
Exploiting Subgraph Structure in Multi-Robot Path Planning. CoRR abs/1111.0053 (2011) - Yulin Ding, Yan Zhang:
CTL Model Update for System Modifications. CoRR abs/1111.0054 (2011) - Anastasia Analyti, Grigoris Antoniou, Carlos Viegas Damásio, Gerd Wagner:
Extended RDF as a Semantic Foundation of Rule Markup Languages. CoRR abs/1111.0055 (2011) - Omer Giménez, Anders Jonsson:
The Complexity of Planning Problems With Simple Causal Graphs. CoRR abs/1111.0056 (2011) - Menkes Hector Louis van den Briel, Thomas Vossen, Subbarao Kambhampati:
Loosely Coupled Formulations for Automated Planning: An Integer Programming Perspective. CoRR abs/1111.0059 (2011) - Daria Terekhov, J. Christopher Beck:
A Constraint Programming Approach for Solving a Queueing Control Problem. CoRR abs/1111.0060 (2011) - Frans A. Oliehoek, Matthijs T. J. Spaan, Nikos Vlassis:
Optimal and Approximate Q-value Functions for Decentralized POMDPs. CoRR abs/1111.0062 (2011) - Claudia V. Goldman, Shlomo Zilberstein:
Communication-Based Decomposition Mechanisms for Decentralized MDPs. CoRR abs/1111.0065 (2011)
skipping 785 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-04-19 06:35 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