Zobrazeno 1 - 10
of 38
pro vyhledávání: '"Computer science, Computer and information sciences"'
Autor:
MIGUEL AREIAS
As linguagens de Programação em Lógica que derivam da lógica de Horn, tal como o Prolog, têm mecanismos de resolução baseados em inferência que são bastante conhecidos. Embora o Prolog seja uma linguagem com bastante sucesso, o seu potencial
Externí odkaz:
https://hdl.handle.net/10216/74598
Publikováno v:
Descriptional Complexity of Formal Systems ISBN: 9783319411132
DCFS
Lecture Notes in Computer Science
18th International Workshop on Descriptional Complexity of Formal Systems (DCFS)
18th International Workshop on Descriptional Complexity of Formal Systems (DCFS), Jul 2016, Bucharest, Romania. pp.45-59, ⟨10.1007/978-3-319-41114-9_4⟩
DCFS
Lecture Notes in Computer Science
18th International Workshop on Descriptional Complexity of Formal Systems (DCFS)
18th International Workshop on Descriptional Complexity of Formal Systems (DCFS), Jul 2016, Bucharest, Romania. pp.45-59, ⟨10.1007/978-3-319-41114-9_4⟩
Extended regular expressions (with complement and intersection) are used in many applications due to their succinctness. In particular, regular expressions extended with intersection only (also called semi-extended) can already be exponentially small
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::cb61b1e37bc65c62bfe72dcb75079371
https://doi.org/10.1007/978-3-319-41114-9_4
https://doi.org/10.1007/978-3-319-41114-9_4
Publikováno v:
Repositório Científico de Acesso Aberto de Portugal
Repositório Científico de Acesso Aberto de Portugal (RCAAP)
instacron:RCAAP
Repositório Científico de Acesso Aberto de Portugal (RCAAP)
instacron:RCAAP
This letter proposes a fast constrained sphere decoder for ill conditioned communications systems that exhibits less complexity than but similar performance to the generalised sphere decoder. The operational principle is based on i) the reduction of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::29138151d7399c44e80e952490be7bee
https://doi.org/10.1109/lcomm.2010.093010.100918
https://doi.org/10.1109/lcomm.2010.093010.100918
Publikováno v:
SAC
Existing works suggest that random inputs and random features produce good results in classification. In this paper we study the problem of generating random rule sets from data streams. One of the most interpretable and flexible models for data stre
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c0ee23ec7fca71f9cef35ef12ec93a73
https://hdl.handle.net/10216/83804
https://hdl.handle.net/10216/83804
The development of Poker agents is a meaningful domain for AI research because it addresses issues such as opponent modeling, risk management and decision-making under uncertain information. The competitiveness of Poker agents is typically measured t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______1406::aa3746cc0077cc8218e0d6d48351f5c2
https://hdl.handle.net/10216/61929
https://hdl.handle.net/10216/61929
Autor:
Mário Antunes, Manuel Correia
This paper presents an artificial immune system (AIS) based on Grossman's tunable activation threshold (TAT) for temporal anomaly detection. We describe the generic AIS framework and the TAT model adopted for simulating T-cells behaviour, emphasizing
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______1406::bb875088f9533d62d8ac4b0ffee53c15
https://hdl.handle.net/10216/94815
https://hdl.handle.net/10216/94815
Publikováno v:
MASS
Simulation of vehicular networks has been extensively studied in the last few years. In order to have an holistic view of the network functioning, communications and vehicle mobility aspects should be modeled in detail and fully integrated. This arti
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ccd38171d65252ca3b0a83b70db70ea4
https://doi.org/10.1109/mass.2010.5663806
https://doi.org/10.1109/mass.2010.5663806
Autor:
Vinay Uday Prabhu, Miguel Rodrigues
In this paper, we consider secure communications between a single antenna transmitter and a single antenna receiver in the presence of a multiple antenna eavesdropper employing MRC or SDC reception. We show that an M-antenna eavesdropper performing S
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______1406::a488ecbfc2892227530b06ecd9835569
https://repositorio-aberto.up.pt/handle/10216/98346
https://repositorio-aberto.up.pt/handle/10216/98346
Recently, the problem of obtaining a short regular expression equivalent to a given finite automaton has been intensively investigated. Algorithms for converting finite automata to regular expressions have an exponential blow-up in the worst-case. To
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______1406::31aac8372e63de6a2936aa9dc1b5b348
https://hdl.handle.net/10216/90548
https://hdl.handle.net/10216/90548
We present a new incremental algorithm for minimising deterministic finite automata. It runs in quadratic time for any practical application and may be halted at any point, returning a partially minimised automaton. Hence, the algorithm may be applie
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______1406::9778f0ebe3e070716fd1366f38167861
https://repositorio-aberto.up.pt/handle/10216/99524
https://repositorio-aberto.up.pt/handle/10216/99524