![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
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 72 matches
- 1995
- Naoki Abe, Hang Li, Atsuyoshi Nakamura:
On-line Learning of Binary Lexical Relations Using Two-dimensional Weighted Majority Algorithms. ICML 1995: 3-11 - Hussein Almuallim, Yasuhiro Akiba, Shigeo Kaneda:
On Handling Tree-Structured Attributed in Decision Tree Learning. ICML 1995: 12-20 - Peter Auer, Robert C. Holte, Wolfgang Maass:
Theory and Applications of Agnostic PAC-Learning with Small Decision Trees. ICML 1995: 21-29 - Leemon C. Baird III:
Residual Algorithms: Reinforcement Learning with Function Approximation. ICML 1995: 30-37 - Shumeet Baluja, Rich Caruana:
Removing the Genetics from the Standard Genetic Algorithm. ICML 1995: 38-46 - Scott Benson:
Inductive Learning of Reactive Action Models. ICML 1995: 47-54 - Justine Blackmore, Risto Miikkulainen:
Visualizing High-Dimensional Structure with the Incremental Grid Growing Neural Network. ICML 1995: 55-63 - Avrim Blum:
Empirical Support for Winnow and Weighted-Majority Based Algorithms: Results on a Calendar Scheduling Domain. ICML 1995: 64-72 - Carla E. Brodley:
Automatic Selection of Split Criterion during Tree Growing Based on Node Location. ICML 1995: 73-80 - Clifford Brunk, Michael J. Pazzani:
A Lexical Based Semantic Bias for Theory Revision. ICML 1995: 81-89 - Philip K. Chan, Salvatore J. Stolfo:
A Comparative Evaluation of Voting and Meta-learning on Partitioned Data. ICML 1995: 90-98 - Pawel Cichosz, Jan J. Mulawka:
Fast and Efficient Reinforcement Learning with Truncated Temporal Differences. ICML 1995: 99-107 - John G. Cleary, Leonard E. Trigg:
K*: An Instance-based Learner Using and Entropic Distance Measure. ICML 1995: 108-114 - William W. Cohen:
Fast Effective Rule Induction. ICML 1995: 115-123 - William W. Cohen:
Text Categorization and Relational Learning. ICML 1995: 124-132 - Susan Craw, Paul Hutton:
Protein Folding: Symbolic Refinement Competes with Neural Networks. ICML 1995: 133-141 - W. Bruce Croft:
Machine Learning and Information Retrieval (Abstract). ICML 1995: 587 - James Cussens:
A Bayesian Analysis of Algorithms for Learning Finite Functions. ICML 1995: 142-149 - Ido Dagan, Sean P. Engelson:
Committee-Based Sampling For Training Probabilistic Classifiers. ICML 1995: 150-157 - Piew Datta, Dennis F. Kibler:
Learning Prototypical Concept Descriptions. ICML 1995: 158-166 - Gerald DeJong:
A Case Study of Explanation-Based Control. ICML 1995: 167-175 - Thomas G. Dietterich, Nicholas S. Flann:
Explanation-Based Learning and Reinforcement Learning: A Unified View. ICML 1995: 176-184 - Steven K. Donoho, Larry A. Rendell:
Lessons from Theory Revision Applied to Constructive Induction. ICML 1995: 185-193 - James Dougherty, Ron Kohavi, Mehran Sahami:
Supervised and Unsupervised Discretization of Continuous Features. ICML 1995: 194-202 - John A. Drakopoulos:
Bounds on the Classification Error of the Nearest Neighbor Rule. ICML 1995: 203-208 - Michael O. Duff:
Q-Learning for Bandit Problems. ICML 1995: 209-217 - Sean P. Engelson, Moshe Koppel:
Distilling Reliable Information From Unreliable Theories. ICML 1995: 218-225 - Philip W. L. Fong:
A Quantitative Study of Hypothesis Selection. ICML 1995: 226-234 - Matthias Fuchs:
Learning Proof Heuristics by Adaptive Parameters. ICML 1995: 235-243 - Truxton Fulton, Simon Kasif, Steven Salzberg:
Efficient Algorithms for Finding Multi-way Splits for Decision Trees. ICML 1995: 244-251
skipping 42 more matches
loading more results
failed to load more results, please try again later
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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-08-30 19:42 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