Остановите войну!
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 77 matches
- 2013
- Jakramate Bootkrajang, Ata Kabán:
Learning a Label-Noise Robust Logistic Regression: Analysis and Experiments. IDEAL 2013: 569-576 - Yaxiong Cai, Huaping Chen, Rui Xu, Hao Shao, Xueping Li:
An Estimation of Distribution Algorithm for the 3D Bin Packing Problem with Various Bin Sizes. IDEAL 2013: 401-408 - Bingqi Cai, Jing Liu:
A Study of Representations for Resource Constrained Project Scheduling Problems Using Fitness Distance Correlation. IDEAL 2013: 218-225 - Lina N. Cao, Xijin Tang:
Prevailing Trends Detection of Public Opinions Based on Tianya Forum. IDEAL 2013: 186-193 - Josu Ceberio, Leticia Hernando, Alexander Mendiburu, José Antonio Lozano:
Understanding Instance Complexity in the Linear Ordering Problem. IDEAL 2013: 479-486 - Lihong Chen, Hongbin Dong, Qilong Han, Guangzhe Cui:
Bilateral Multi-issue Parallel Negotiation Model Based on Reinforcement Learning. IDEAL 2013: 40-48 - Jian Cheng, Yi-Nan Guo:
Kernel Based Manifold Learning for Complex Industry Fault Detection. IDEAL 2013: 392-400 - Shi Cheng, Yuhui Shi, Quande Qin, Ruibin Bai:
Swarm Intelligence in Big Data Analytics. IDEAL 2013: 417-426 - Marwa Djeffal, Habiba Drias:
Multilevel Bee Swarm Optimization for Large Satisfiability Problem Instances. IDEAL 2013: 594-602 - Jianqiang Dong, Fei Wang, Bo Yuan:
Accelerating BIRCH for Clustering Large Scale Streaming Data Using CUDA Dynamic Parallelism. IDEAL 2013: 409-416 - Habiba Drias, Ameur Douib, Célia Hirèche:
Swarm Intelligence with Clustering for Solving SAT. IDEAL 2013: 585-593 - Martin Emms:
Dynamic EM in Neologism Evolution. IDEAL 2013: 286-293 - Fangmei Fu, Jiong Jia, Zhonglong Zheng, Fan Yang, Li Guo, Haixin Zhang, Mudan Yu:
Super-Resolution from One Single Low-Resolution Image Based on R-KSVD and Example-Based Algorithm. IDEAL 2013: 32-39 - Sen Bong Gee, Xin Qiu, Kay Chen Tan:
A Novel Diversity Maintenance Scheme for Evolutionary Multi-objective Optimization. IDEAL 2013: 270-277 - Marcin Gorawski, Aleksander Chrószcz, Anna Gorawska:
Customer Unification in E-Commerce. IDEAL 2013: 142-152 - Lars Gräning, Thomas Ramsay:
Quantifying Flow Field Distances Based on a Compact Streamline Representation. IDEAL 2013: 445-454 - Yi-Nan Guo, Meirong Chen, Chun Wang:
Multi-objective Quantum Cultural Algorithm and Its Application in the Wireless Sensor Networks' Energy-Efficient Coverage Optimization. IDEAL 2013: 161-167 - Shanqing Hu, Bin Li:
Velocity Divergence of CCPSO in Large Scale Global Optimization. IDEAL 2013: 545-552 - Binbin Huang, Rongheng Lin, Kai Peng, Hua Zou, Fangchun Yang:
Efficient Service Deployment by Image-Aware VM Allocation Strategy. IDEAL 2013: 252-261 - Kemal Ince, Frank Klawonn:
Handling Different Levels of Granularity within Naive Bayes Classifiers. IDEAL 2013: 521-528 - Daniel Isemann, Khurshid Ahmad, Tim Fernando, Carl Vogel:
Temporal Dependence in Legal Documents. IDEAL 2013: 497-504 - Yusheng Jia, Wanqi Yang, Yang Gao, Hujun Yin, Yinghuan Shi:
Image Super Resolution via Visual Prior Based Digital Image Characteristics. IDEAL 2013: 168-177 - Dinesh Kumar Kashyap, Gurpreet Singh Josan:
A Trigram Language Model to Predict Part of Speech Tags Using Neural Network. IDEAL 2013: 513-520 - Piotr Lasek:
An Extended Version of the LVA-Index. IDEAL 2013: 126-133 - Na Li, Qiang Guan:
Deadline-Aware Event Scheduling for Complex Event Processing Systems. IDEAL 2013: 101-109 - Baoli Li, Liping Han:
Distance Weighted Cosine Similarity Measure for Text Classification. IDEAL 2013: 611-618 - Yung Siang Liau, Kay Chen Tan, Jun Hu, Xin Qiu, Sen Bong Gee:
Machine Learning Enhanced Multi-Objective Evolutionary Algorithm Based on Decomposition. IDEAL 2013: 553-560 - Dariusz Lipinski, Maciej Majewski:
System for Monitoring and Optimization of Micro- and Nano-Machining Processes Using Intelligent Voice and Visual Communication. IDEAL 2013: 16-23 - Yonghui Liu, Weidong Min:
Network Management Based on Domain Partition for Mobile Agents. IDEAL 2013: 153-160 - Jinpeng Liu, Ke Tang:
Scaling Up Covariance Matrix Adaptation Evolution Strategy Using Cooperative Coevolution. IDEAL 2013: 350-357
skipping 47 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-24 10:13 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