1701 search results - page 208 / 341 » Computer Science and State Machines |
137
click to vote
FOCS
2002
IEEE
15 years 3 months ago
2002
IEEE
The Constraint Satisfaction Problem (CSP) provides a common framework for many combinatorial problems. The general CSP is known to be NP-complete; however, certain restrictions on...
DIS
2001
Springer
15 years 2 months ago
2001
Springer
Abstract. State of the art equation discovery systems start the discovery process from scratch, rather than from an initial hypothesis in the space of equations. On the other hand,...
103
click to vote
STACS
2001
Springer
15 years 2 months ago
2001
Springer
We prove new results on evasiveness of monotone graph properties by extending the techniques of Kahn, Saks, and Sturtevant [Combinatorica, 4 (1984), pp. 297–306]. For the propert...
RTA
1998
Springer
15 years 2 months ago
1998
Springer
There is a close relationship between word unification and second-order unification. This similarity has been exploited for instance for proving decidability of monadic second-orde...
SOFSEM
1998
Springer
15 years 2 months ago
1998
Springer
Abstract. Based on the specific characteristics of electronic commerce (ECommerce) requirements for an adequate system support, this contribution gives an overview of the respectiv...