Model checkers search the space of possible program behaviors to detect errors and to demonstrate their absence. Despite major advances in reduction and optimization techniques, s...
Matthew B. Dwyer, Sebastian G. Elbaum, Suzette Per...
We first present a method, called Two-Phase Pareto Local Search, to find a good approximation of the efficient set of the biobjective traveling salesman problem. In the first p...
Abstract. Search is until now a difficult problem in peer-to-peer (P2P) filesharing systems. In this paper, we propose to use adaptive metadata spreading to make search in P2P netw...
Xuezheng Liu, Guangwen Yang, Ming Chen, Yongwei Wu
Traditionally, Predator-Prey Models--although providing a more nature-oriented approach to multi-objective optimization than many other standard Evolutionary Multi-Objective Algori...
Christian Grimme, Joachim Lepping, Alexander Papas...
We present a randomized strategy for maintaining balance in dynamically changing search trees that has optimal expected behavior. In particular, in the expected case a search or a...