Sciweavers

1414 search results - page 26 / 283
» Randomness and Universal Machines
Sort
View
FUIN
2002
90views more  FUIN 2002»
13 years 8 months ago
A Direct Construction of a Universal P System
We present a direct universal P system based on splicing. Our approach differs from those shown in previous papers as the P system we construct takes as input an encoding of anothe...
Pierluigi Frisco, Hendrik Jan Hoogeboom, Paul Sant
ICALT
2005
IEEE
14 years 2 months ago
Predicting Students' Marks in Hellenic Open University
The ability to provide assistance for a student at the appropriate level is invaluable in the learning process. Not only does it aid the student’s learning process but also prev...
Sotiris B. Kotsiantis, Panayiotis E. Pintelas
COLT
2008
Springer
13 years 10 months ago
Almost Tight Upper Bound for Finding Fourier Coefficients of Bounded Pseudo- Boolean Functions
A pseudo-Boolean function is a real-valued function defined on {0, 1}n . A k-bounded function is a pseudo-Boolean function that can be expressed as a sum of subfunctions each of w...
Sung-Soon Choi, Kyomin Jung, Jeong Han Kim
ARCS
1997
Springer
14 years 24 days ago
A Novel Universal Sequencer Hardware
This paper introduces a powerful novel sequencer hardware for controlling computational machines and for structured DMA (direct memory access) applications. The paper introduces t...
Reiner W. Hartenstein, Jürgen Becker, Michael...
CP
2007
Springer
14 years 2 months ago
On Universal Restart Strategies for Backtracking Search
Abstract. Constraint satisfaction and propositional satisfiability problems are often solved using backtracking search. Previous studies have shown that a technique called randomi...
Huayue Wu, Peter van Beek