728 search results - page 27 / 146 » Efficient Searching with Linear Constraints |
111
click to vote
ICTAI
1999
IEEE
15 years 6 months ago
1999
IEEE
Recently, there has been much interest in enhancing purely combinatorial formalisms with numerical information. For example, planning formalisms can be enriched by taking resource...
191
click to vote
CP
2009
Springer
16 years 2 months ago
2009
Springer
Many problems require minimally perturbing an initial state in order to repair some violated constraints. We consider two search spaces for exactly solving this minimal perturbatio...
ICASSP
2009
IEEE
15 years 5 months ago
2009
IEEE
In this paper, we solve the problem of detecting the entries of a sparse finite-alphabet signal from a limited amount of data, for instance obtained by compressive sampling. While...
138
click to vote
SIAMCOMP
2002
15 years 1 months ago
2002
Linear quantum cellular automata were introduced recently as one of the models of quantum computing. A basic postulate of quantum mechanics imposes a strong constraint on any quan...
108
click to vote
CORR
2008
Springer
15 years 2 months ago
2008
Springer
Abstract. Arithmetic automata recognize infinite words of digits denoting decompositions of real and integer vectors. These automata are known expressive and efficient enough to re...