Given a bipartite graph G = (L0, L1, E) and a fixed ordering of the nodes in L0, the problem of finding an ordering of the nodes in L1 that minimizes the number of crossings has ...
Abstract. The Galois connection involving polymorphisms and coclones has received a lot of attention in regard to constraint satisfaction problems. However, it fails if we are inte...
Recently, attention has been given to formally characterize security policies that are enforceable by different kinds of security mechanisms. A very important research problem is ...
This paper presents Group Membership Service for JXTA extended with single or bi-directional authentication. The proposed solution exploits certificates and PKI (Public Key Infrast...
Lukasz Kawulok, Krzysztof Zielinski, Michal Jaesch...
—Design patterns are codified solutions to common object-oriented design (OOD) problems in software development. One of the proclaimed benefits of the use of design patterns is...
Daryl Posnett, Christian Bird, Premkumar T. Devanb...