Sciweavers

14774 search results - page 184 / 2955
» Computational complexity and evolutionary computation
Sort
View
IAT
2009
IEEE
15 years 11 months ago
Computing Information Minimal Match Explanations for Logic-Based Matchmaking
Abstract—In semantic matchmaking processes it is often useful, when the obtained match is not full, to provide explanations for the mismatch, to leverage further interaction and/...
Tommaso Di Noia, Eugenio Di Sciascio, Francesco M....
ALGORITHMICA
2010
92views more  ALGORITHMICA 2010»
15 years 4 months ago
Quantum Separation of Local Search and Fixed Point Computation
In this paper, we give a lower bound of (n(d-1)/2 ) on the quantum query complexity for finding a fixed point of a discrete Brouwer function over grid [1 : n]d . Our bound is near...
Xi Chen, Xiaoming Sun, Shang-Hua Teng
BMCBI
2008
111views more  BMCBI 2008»
15 years 4 months ago
MLIP: using multiple processors to compute the posterior probability of linkage
Background: Localization of complex traits by genetic linkage analysis may involve exploration of a vast multidimensional parameter space. The posterior probability of linkage (PP...
Manika Govil, Alberto Maria Segre, Veronica J. Vie...
IPPS
2007
IEEE
15 years 11 months ago
A hybrid Evolutionary Algorithm for the Dynamic Resource Constrained Task Scheduling Problem
This work presents a new hybrid Evolutionary Algorithm for the Dynamic Resource Constrained Task Scheduling Problem (DRCTSP). The most important differences between the new EA and...
André Renato Villela da Silva, Luiz Satoru ...
IWINAC
2005
Springer
15 years 10 months ago
Network of Evolutionary Processors with Splicing Rules
In this paper we consider networks of evolutionary processors with splicing rules and permitting context (NEPPS) as language generating and computational devices. Such a network c...
Ashish Choudhary, Kamala Krithivasan