Sciweavers

1650 search results - page 307 / 330
» The HOM problem is decidable
Sort
View
MST
2006
104views more  MST 2006»
13 years 7 months ago
Sequencing from Compomers: The Puzzle
The board game FragmindTM poses the following problem: The player has to reconstruct an (unknown) string s over the alphabet . To this end, the game reports the following informati...
Sebastian Böcker
IJFCS
2007
105views more  IJFCS 2007»
13 years 7 months ago
On the Existence of Lookahead Delegators for NFA
We investigate deterministically simulating (i.e., solving the membership problem for) nondeterministic finite automata (NFA), relying solely on the NFA’s resources (states and...
Bala Ravikumar, Nicolae Santean
APAL
2002
101views more  APAL 2002»
13 years 7 months ago
The logic of tasks
The paper introduces a semantics for the language of classical first order logic supplemented with the additional operators and . This semantics understands formulas as tasks. An ...
Giorgi Japaridze
AI
1999
Springer
13 years 7 months ago
Introspective Multistrategy Learning: On the Construction of Learning Strategies
A central problem in multistrategy learning systems is the selection and sequencing of machine learning algorithms for particular situations. This is typically done by the system ...
Michael T. Cox, Ashwin Ram
PR
2007
149views more  PR 2007»
13 years 7 months ago
Real-time detection of steam in video images
In this paper, we present a real-time image processing technique for the detection of steam in video images. The assumption made is that the presence of steam acts as a blurring p...
Ricardo J. Ferrari, H. Zhang, C. R. Kube