In: Genetic Programming and Evolvable Machines, 2008, vol. 9, no. 4, p. 295-329
|
In: European Journal of Operational Research, 2011, vol. 210, no. 2, p. 169-175
Given a graph G =(V, E), a satisfying bisection of G is a partition of the vertex set V into two sets V1, V2, such that |V1| = |V2|, and such that every vertex v in V has at least as many neighbors in its own set as in the other set. The problem of deciding whether a graph G admits such a partition is NP-complete. In Bazgan et al. (2008) [C. Bazgan, Z. Tuza, D. Vanderpooten, Approximation of...
|
In: Personal and Ubiquitous Computing, 2015, vol. 19, no. 1, p. 123-141
|
In: Machines, 2020, vol. 8, no. 4, p. 17
Industrial robots are commonly used to perform interaction tasks (such as assemblies or polishing), requiring the robot to be in contact with the surrounding environment. Such environments are (partially) unknown to the robot controller. Therefore, there is the need to implement interaction controllers capable of suitably reacting to the established contacts. Although standard force controllers...
|
In: Quantum reports, 2021, vol. 3, no. 2, p. 272-285
It has been more than 20 years since Deutsch and Hayden proved the locality of quantum theory, using the Heisenberg picture of quantum computational networks. Of course, locality holds even in the face of entanglement and Bell’s theorem. Today, most researchers in quantum foundations are still convinced not only that a local description of quantum systems has not yet been provided, but that...
|
In: Interacting with Computers, 1998, vol. 10, no. 1, p. 31-44
|
In: International Journal on Software Tools for Technology Transfer, 2012, vol. 14, no. 1, p. 1-14
|
In: Bioinformatics, 2017, vol. 33, no. 5, p. 669-676
|
In: Mathematical Programming, 2009, vol. 120, no. 1, p. 179-210
|
In: Language Resources and Evaluation, 2005, vol. 39, no. 1, p. 45-64
|
