1795 search results - page 131 / 359 » On the Complexity of Circuit Satisfiability |
164
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
An infinite word has the property Rm if every factor has exactly m return words. Vuillon showed that R2 characterizes Sturmian words. We prove that a word satisfies Rm if its compl...
176
click to vote
JWSR
2007
15 years 6 months ago
2007
: A major challenge for Service–oriented Computing is how to discover and compose (Web) services to build complex applications. We present a matchmaking system that exploits both...
181
click to vote
EVOW
2001
Springer
15 years 10 months ago
2001
Springer
The integrated circuits design flow is rapidly moving towards higher description levels. However, test-related activities are lacking behind this trend, mainly since effective faul...
126
click to vote
AISC
2006
Springer
15 years 9 months ago
2006
Springer
Abstract. The Complete Root Classification for a univariate polynomial with symbolic coefficients is the collection of all the possible cases of its root classification, together w...
155
click to vote
ESOA
2006
15 years 9 months ago
2006
Holonic Multi-Agent Systems (HMAS) are a convenient way to engineer complex and open systems. In such systems, agents have to be able to self-organize to satisfy their goals. Our w...