7988 search results - page 1023 / 1598 » A Useful Undecidable Theory |
194
click to vote
HICSS
2007
IEEE
16 years 1 months ago
2007
IEEE
Using multiple lenses of strategic choice theories (diffusion of innovation, organizational innovativeness) and institutional theory as the basis and reflecting data from semi-str...
211
Voted
KBSE
2007
IEEE
16 years 1 months ago
2007
IEEE
Monitoring the satisfaction of software requirements and diagnosing what went wrong in case of failure is a hard problem that has received little attention in the Software and Req...
183
Voted
GECCO
2007
Springer
16 years 1 months ago
2007
Springer
The Blob Code is a bijective tree code that represents each tree on n labelled vertices as a string of n − 2 vertex labels. In recent years, several researchers have deployed th...
183
click to vote
GECCO
2007
Springer
16 years 1 months ago
2007
Springer
The runtime analysis of randomized search heuristics is a growing field where, in the last two decades, many rigorous results have been obtained. These results, however, apply pa...
220
Voted
ICALP
2007
Springer
16 years 1 months ago
2007
Springer
We present algebraic conditions on constraint languages Γ that ensure the hardness of the constraint satisfaction problem CSP(Γ) for complexity classes L, NL, P, NP and ModpL. Th...