Остановите войну!
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 28 matches
- 2001
- Carmelo Asaro, Ephraim Nissan:
The DAEDALUS System: a Tool for the Italian Investigating Magistrate. Comput. Artif. Intell. 20(6): 515-554 (2001) - Afzal Ballim, Tomas By, Yorick Wilks, Christian Lieske:
Modelling Agent Attitudes in Legal Reasoning. Comput. Artif. Intell. 20(6): 581-624 (2001) - Gerardo Bandera, Emilio L. Zapata:
Using Semantical Information to Enhance the Parallel Sparse Performance. Comput. Artif. Intell. 20(3): 303-321 (2001) - Dirk Bongartz:
On the Approximation Ratio of the Group-Merge Algorithm for the Shortest Common Superstring Problem. Comput. Artif. Intell. 20(4): 325-357 (2001) - Ioannis Caragiannis, Christos Kaklamanis, Giuseppe Persiano:
Wavelength Routing in All-optical Tree Networks: A Survey. Comput. Artif. Intell. 20(2): 95-120 (2001) - Hsuan-Ming Feng, Wen-Hsing Kao:
A Rule-Based Scalar Tuning Fuzzy Control System. Comput. Artif. Intell. 20(4): 395-409 (2001) - Dimitris Fotakis, Sotiris E. Nikoletseas, Vicky G. Papadopoulou, Paul G. Spirakis:
Hardness Results and Efficient Approximations for Frequency Assignment Problems: Radio Labelling and Radio Coloring. Comput. Artif. Intell. 20(2): 121-180 (2001) - Zineb Habbas, Francine Herrmann, Michaël Krajecki:
A Fast Parallel Tree Contraction for the Ray-object Calculus Using Open-MP. Comput. Artif. Intell. 20(1): 77-92 (2001) - Ghita Holmstrom-Hintikka:
Expert Witnesses in the Interrogative Model. Comput. Artif. Intell. 20(6): 555-579 (2001) - Mingxing Hu, Baozong Yuan, Xiaofang Tang:
A New Robust Fundamental Matrix Estimation Based on Genetic Algorithm. Comput. Artif. Intell. 20(5): 471-486 (2001) - Predrag Janicic, Nenad Dedic, Goran Terzic:
On Different Models for Generating Random SAT Problems. Comput. Artif. Intell. 20(5): 451-469 (2001) - Wu Jigang, Lei Yunfei, Heiko Schröder:
A Minimal Reduction Approach for the Collapsing Knapsack Problem. Comput. Artif. Intell. 20(4): 359-369 (2001) - Rujie Liu, Baozong Yuan:
Automatic Eye Feature Extraction in Human Face Images. Comput. Artif. Intell. 20(3): 289-301 (2001) - Mihhail Matskin, Enn Tyugu:
Strategies of Structural Synthesis of Programs and its Extensions. Comput. Artif. Intell. 20(1): 1-25 (2001) - José M. Molina, Inés María Galván, José María Valls, Andrés Leal:
Optimizing the Number of Learning Cycles in the Design of Radial Basis Neural Networks Using a Multi-Agent System. Comput. Artif. Intell. 20(5): 429-449 (2001) - Ephraim Nissan:
An AI Formalism for Competing Claims of Identification: Capturing the "Smemorato di Collegno" Amnesia Case. Comput. Artif. Intell. 20(6): 625-656 (2001) - Ephraim Nissan, Antonio A. Martino:
Guest Editorial. Comput. Artif. Intell. 20(6) (2001) - Nadim Obeid:
On the Connection Between Normal Default Reasoning and Conditional Logic. Comput. Artif. Intell. 20(1): 43-66 (2001) - Juan M. Orduña, Federico Silla, José Duato:
Towards a Communication-Aware Task Scheduling Strategy for Heterogeneous Systems. Comput. Artif. Intell. 20(3): 245-267 (2001) - Peter Ruzicka:
On Efficiency of Path Systems Induced by Routing and Communication Schemes. Comput. Artif. Intell. 20(2): 181-205 (2001) - Petr Salinger, Pavel Tvrdík:
All-to-All Scatter in de Bruijn and Kautz Networks. Comput. Artif. Intell. 20(4): 371-393 (2001) - A. C. Cem Say:
Improved Reasoning About Infinity Using Qualitative Simulation. Comput. Artif. Intell. 20(5): 487-507 (2001) - Bertil Schmidt, Heiko Schröder:
A Hybrid Architecture for Multimedia Processors. Comput. Artif. Intell. 20(3): 225-244 (2001) - Bertil Schmidt, Heiko Schröder, Manfred Schimmler:
Tomographic Image Reconstruction on the Instruction Systolic Array. Comput. Artif. Intell. 20(1): 27-42 (2001) - Stephen Taylor, Brian Knight, Miltos Petridis, John Ewer, Edwin Galea:
A Case Based Reasoning System Capturing Fire Modelling Expertise. Comput. Artif. Intell. 20(3): 269-288 (2001) - Liberios Vokorokos:
Data Flow Computing Model: Application for Parallel Computer Systems Diagnosis. Comput. Artif. Intell. 20(4): 411-428 (2001) - Yi-Fan Wang, Mei-Hua Hsu, Yu-Liang Chuang:
Predicting CPU Utilization by Fuzzy Stochastic Prediction. Comput. Artif. Intell. 20(1): 67-76 (2001) - Shmuel Zaks:
Design Issues in ATM and Optical Networks. Comput. Artif. Intell. 20(2): 207-224 (2001)
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-15 02: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