Filters
Exact quantum algorithms have advantage for almost all Boolean functions
It has been proved that almost all n-bit Boolean functions have exact classical query complexity n. However, the situation seemed to be very different when we deal with exact quantum query complexity. In this paper, we prov...
IN - Informatika
- 2015 •
- Jx •
- Link
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Výsledek na webu
Evolutionary Algorithms for Boolean Queries Optimization
Usage of genetic algorithms in the Information Retrieval area, especially in optimizing a Boolean query, is presented in this paper. The proposed evolution of Boolean queries should increase the performance of the ...
BA - Obecná matematika
- 2006 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Boolean Queries Optimization by Genetic Algorithms
Most of information retrieval systems depend on Boolean queries. The performance of an information retrieval sys tem is usually measured in terms of two different criteria, precision and recall. This way, the optimization of any of ...
BB - Aplikovaná statistika, operační výzkum
- 2005 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Experiments with Automatic Query Formulation in the Extended Boolean Model
This paper concentrates on experiments with automatic creation of queries from natural language topics, suitable for use in the Extended Boolean information retrieval system. Because of the lack and/or inadequacy of the available me...
JD - Využití počítačů, robotika a její aplikace
- 2009 •
- D
Rok uplatnění
D - Stať ve sborníku
A faster implementation of EQ and SE queries for switch-list representations
A switch-list representation (SLR) of a Boolean function is a compressed truth table representation of a Boolean function in which only (i) the function value is a Boolean vector whose function value differs from the value ...
Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
- 2024 •
- Jimp •
- Link
Rok uplatnění
Jimp - Článek v periodiku v databázi Web of Science
Výsledek na webu
Fuzzy Classification by Evolutionary Algorithms
programming to the evolution of fuzzy classifiers based on extended Boolean queries. Extended Boolean queries are well known concept in the area of fuzzy information retrieval. An extended Boolean que...
IN - Informatika
- 2011 •
- D •
- Link
Rok uplatnění
D - Stať ve sborníku
Výsledek na webu
A Direct Equivalence-Testing Algorithm for SLRs
(SLRs) of Boolean functions. An SLR is a compressed truth table representation of a Boolean function: we only store the function value of the first row, and a list of switches (Boolean vectors whose function value differs ...
Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
- 2022 •
- O •
- Link
Rok uplatnění
O - Ostatní výsledky
Výsledek na webu
Implementing GP on optimizing boolean and extended boolean queries in IRs with respect to users profiles
of search queries.
IN - Informatika
- 2006 •
- D
Rok uplatnění
D - Stať ve sborníku
Properties of Switch-List Representations of Boolean Functions
In this paper, we focus on a less usual way to represent Boolean functions representations. Given a truth table representation of a Boolean function f the switch-list representation of f is a list of Boolean vectors from th...
Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
- 2020 •
- Jimp •
- Link
Rok uplatnění
Jimp - Článek v periodiku v databázi Web of Science
Výsledek na webu
Implementing GP on Optimizing both, Boolean and Extended Boolean Queries in IR and Fuzzy IR systems with Respect to the Users Profiles
and fuzzy IR (FIR) systems optimisation of search queries is presented.
IN - Informatika
- 2006 •
- D
Rok uplatnění
D - Stať ve sborníku
- 1 - 10 out of 2 786