In: Entropy, 2019, vol. 21, no. 2, p. 104
In view of the importance of quantum non-locality in cryptography, quantum computation, and communication complexity, it is crucial to decide whether a given correlation exhibits non-locality or not. As proved by Pitowski, this problem is NP- complete, and is thus computationally intractable unless NP is equal to P. In this paper, we first prove that the Euclidean distance of given...
|
Thèse de doctorat : Università della Svizzera italiana, 2019 ; 2019INFO009.
This work focuses on optimizing node placement for time-of-flight-based wireless localization networks. Main motivation are critical safety applications. The first part of my thesis is an experimental study on in-tunnel vehicle localization. In- tunnel localization of vehicles is crucial for emergency management, especially for large trucks transporting dangerous goods such as inflammable...
|
In: Advances in Computational Mathematics, 2014, vol. 40, no. 3, p. 683-702
|
Thèse de doctorat : Università della Svizzera italiana, 2018 ; 2018INFO011.
The field of logistics and combinatorial optimization features a wealth of NP-hard problems that are of great practical importance. For this reason it is important that we have efficient algorithms to provide optimal or near-optimal solutions. In this work, we study, compare and develop Sampling-Based Metaheuristics and Exact Methods for logistic problems that are important for their...
|
In: European Radiology, 2004, vol. 14, no. 10, p. 1866-1872
|
In: Natural Computing, 2009, vol. 8, no. 2, p. 239-287
|
In: Engineering with Computers, 2010, vol. 26, no. 2, p. 193-203
|
In: Analog Integrated Circuits and Signal Processing, 2010, vol. 62, no. 2, p. 131-140
|
In: Environmental Earth Sciences, 2011, vol. 63, no. 6, p. 1155-1167
|
In: The International Journal of Life Cycle Assessment, 2012, vol. 17, no. 4, p. 504-510
|
