3897 search results - page 479 / 780 » complexity 2010 |
165
click to vote
TACAS
2010
Springer
16 years 1 months ago
2010
Springer
Deciding whether a modal formula is satisfiable with respect to a given set of (global) assumptions is a question of fundamental importance in applications of logic in computer sc...
166
click to vote
TACAS
2010
Springer
16 years 1 months ago
2010
Springer
Modern multicore processors, such as the Cell Broadband Engine, achieve high performance by equipping accelerator cores with small “scratchpad” memories. The price for increase...
163
click to vote
STACS
2010
Springer
16 years 1 months ago
2010
Springer
In this paper we consider the problem of testing whether two finite groups are isomorphic. Whereas the case where both groups are abelian is well understood and can be solved effi...
167
click to vote
STACS
2010
Springer
16 years 1 months ago
2010
Springer
Reachability and shortest path problems are NL-complete for general graphs. They are known to be in L for graphs of tree-width 2 [14]. However, for graphs of treewidth larger than ...
172
click to vote
CISIS
2010
IEEE
16 years 1 months ago
2010
IEEE
— The engineering of complex production automation systems involves experts from several backgrounds, such as mechanical, electrical, and software engineering. The production aut...