The Hamiltonian Cycle problem asks if an n-vertex graph G has a cycle passing through all vertices of G. This problem is a classic NP-complete problem. So far, finding an exact al...
Hajo Broersma, Fedor V. Fomin, Pim van 't Hof, Dan...
- One of the major areas of software engineering, as specified in the SWEBOK (SoftWare Engineering Body Of Knowledge) [1], is software quality. This paper presents an argument on w...
In this paper, we investigate the application of nonbinary low-density parity-check (LDPC) cycle codes over Galois field GF(q) to multiple-input multiple-output (MIMO) channels. Tw...
We report three experiments on manual detection of torque variations experienced through a rotary switch. The experiments were designed to investigate whether torque perception was...
Hong Z. Tan, Shuo Yang, Zygmunt Pizlo, Pietro Butt...
We consider a shared store based on distributed shared memory (DSM), supporting persistence by reachability (PBR), a very simple data sharing model for a distributed system. This ...