855 search results - page 33 / 171 » Complexity of Equations over Sets of Natural Numbers |
AGP
1999
IEEE
15 years 2 months ago
1999
IEEE
Disunification is the problem of deciding satisfiability of a system of equations and disequations with respect to a given equational theory. In this paper we study the disunifica...
CONSTRAINTS
2007
14 years 9 months ago
2007
In the ECAD area, the Test Generation (TG) problem consists in finding an input vector test for some possible diagnosis (a set of faults) of a digital circuit. Such tests may have ...
IJCAI
1997
14 years 11 months ago
1997
This paper studies constraint satisfaction over connected row-convex (CRC) constraints. It shows that CRC constraints are closed under composition, intersection, and transposition...
156
click to vote
ICDE
2008
IEEE
15 years 11 months ago
2008
IEEE
Text documents often embed data that is structured in nature, and we can expose this structured data using information extraction technology. By processing a text database with inf...
TIT
2008
14 years 9 months ago
2008
We investigate resource allocation policies for time-division multiple access (TDMA) over fading channels in the power-limited regime. For frequency-flat block-fading channels and ...