2150 search results - page 65 / 430 » On a restricted cross-intersection problem |
134
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
: In this paper we present several algorithmic techniques for inferring the structure of a company when only a limited amount of information is available. We consider problems with...
167
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
In connection with machine arithmetic, we are interested in systems of constraints of the form x + k y + k . Over integers, the satisfiability problem for such systems is polynomi...
152
click to vote
ICPR
2008
IEEE
16 years 7 months ago
2008
IEEE
We present algorithms for improved Viterbi decoding for the case of hidden semi-Markov models. By carefully constructing directed acyclic graphs, we pose the decoding problem as t...
173
click to vote
UC
2009
Springer
16 years 1 months ago
2009
Springer
Membrane systems with dividing and dissolving membranes are known to solve PSPACE problems in polynomial time. However, we give a P upperbound on an important restriction of such s...
164
click to vote
AUTOMATICA
2002
15 years 6 months ago
2002
This paper considers the problem of designing a controller for an unknown plant based on input/output measurements. The new design method we propose is direct (no model identificat...