| |
1-10 of 30 reviews |
Date Reviewed | |
| |
Can machine learning learn a decision oracle for NP problems? A test on SAT
Grozea C., Popescu M. Fundamenta Informaticae 131(3-4): 441-450, 2014. Type: Article
Finding good heuristics for a nondeterministic polynomial-time (NP) problem is a very important research goal that is mostly addressed on a case-by-case basis. This paper takes a different path: a classic NP problem, 3-SAT, is used as ...
|
Jul 30 2014 |
|
| |
Memory-based state-estimation
Jüngel M., Mellmann H. Fundamenta Informaticae 85(1-4): 297-311, 2008. Type: Article
State estimation is a process of determining the current state of a complex system by analyzing past observations. It is broadly used in control theory and space technology, providing an effective tool for failure detection and autonom...
|
Aug 19 2009 |
|
| |
On rational stochastic languages
Denis F., Esposito Y. Fundamenta Informaticae 86(1,2): 41-77, 2008. Type: Article
This paper presents a series of interrelated results on classes of formal power series that are generated by various types of weighted finite automata. In the early 1960s, Schützenberger initiated the idea of studying rational...
|
Jun 5 2009 |
|
| |
External memory algorithms for string problems
Roh K., Crochemore M., Iliopoulos C., Park K. Fundamenta Informaticae 84(1): 17-32, 2008. Type: Article
Modern systems typically use a cheaper external memory with a high storage capacity. Since access to this memory is relatively slow compared to the internal memory, applications that process huge amounts of data need to minimize commun...
|
Apr 15 2009 |
|
| |
Advances in symmetric sandpiles
Formenti E., Masson B., Pisokas T. Fundamenta Informaticae 76(1-2): 91-112, 2007. Type: Article
A formal sandpile is a finite sequence of integers (c1, ... , cr) that is obtained by applying the following rules: the initial value is (n
|
May 14 2008 |
|
| |
Guided model checking with a Bayesian meta-heuristic
Seppi K., Jones M., Lamborn P. Fundamenta Informaticae 70(1): 111-126, 2006. Type: Article
Model checking is a way to debug protocols and software. A tool searches for states where requirements are not met. One challenge is speeding up the search. Heuristics are used for this purpose. This paper proposes and tests a way to i...
|
Nov 9 2006 |
|
| |
 On the relationship between monadic and weak monadic second order logic on arbitrary trees, with applications to the mu-calculus
Janin D., Lenzi G. Fundamenta Informaticae 61(3,4): 247-265, 2004. Type: Article
The automatic verification of software systems against their specifications is one of the most important goals of computer science. It is well known that this can never be fully achieved, but it is important to push the frontier of wha...
|
Nov 2 2005 |
|
| |
Image indexing by distributed color temperature descriptions
Wnukowicz K. Fundamenta Informaticae 61(3,4): 369-378, 2004. Type: Article
Several multimedia applications must access large databases, which may be queried and searched for different purposes. Images are a major data type stored and managed by these applications. Images contain many features (such as color, ...
|
Sep 13 2005 |
|
| |
Asynchronous circuits, communicating processes, and muller automaton
Redziejowski R. Fundamenta Informaticae 61(1): 47-59, 2004. Type: Article
Approximately two-thirds of this short communication consists of definitions and examples of asynchronous circuits (in the formulation of Muller and Bartky) and communicating processes (as described by Dijkstra). In fact, two of these ...
|
Aug 4 2005 |
|
| |
Conjoinability in pregroups
Kiślak-Malinowska A. Fundamenta Informaticae 61(1): 29-36, 2004. Type: Article
Pregroups are novel algebraic structures introduced by Lambek for the study of sentence structure. A pregroup is a partially ordered monoid together with unary right adjoint and left adjoint operators. This new algebra enables the soph...
|
Jul 5 2005 |
|
| |
|
|
| |
|
|
|
|
