3818 search results - page 394 / 764 » Word Problems on Compressed Words |
174
click to vote
JCO
2010
15 years 5 months ago
2010
This paper considers an on-line scheduling problem occurred in a service system with two classes (normal and special) of customers and two types (dedicated and flexible) of serve...
179
click to vote
JSC
2010
15 years 5 months ago
2010
The topic of this article is decision procedures for satisfiability modulo theories (SMT) of arbitrary quantifier-free formulæ. We propose an approach that decomposes the formu...
155
click to vote
JUCS
2010
15 years 5 months ago
2010
: Decision making under uncertainty is a key issue in information fusion and logic based reasoning approaches. The aim of this paper is to show noteworthy theoretical and applicati...
160
click to vote
JUCS
2010
15 years 5 months ago
2010
: We investigate the problem of decomposing a language into a catenation of nontrivial languages, none of which can be decomposed further. In many cases this leads to the operation...
176
click to vote
MCS
2010
Springer
15 years 5 months ago
2010
Springer
Many different constructions for (t, m, s)-nets and (t, s)-sequences are known today. Propagation rules as well as connections to other mathematical objects make it difficult to ...