We discuss some new geometric puzzles and the complexity of their extension to arbitrary sizes. For gate puzzles and two-layer puzzles we prove NP-completeness of solving them. No...
Helmut Alt, Hans L. Bodlaender, Marc J. van Krevel...
Abstract. Network security is considered one of the obstacles that prevent the wide deployment of ad-hoc wireless networks. Among many security problems, authentication is the most...
- In this paper, we explore a new concept, called on-chip diversity, and introduce a design methodology for such emerging systems. Simply speaking, on-chip diversity means mixing d...
Abstract. We present a new hybrid constraint solving schema which retains some systematicity of constructive search while incorporating the heuristic guidance and lack of commitmen...
This paper presents an object-oriented approach for describing and modelling buildings by means of computer graphics. The approach is based on an object- and component-oriented gr...