2899 search results - page 52 / 580 » On the Complexity of Exclusion Algorithms for Optimization |
116
click to vote
ICASSP
2011
IEEE
14 years 5 months ago
2011
IEEE
The maximization of a positive (semi)definite complex quadratic form over a finite alphabet is NP-hard and achieved through exhaustive search when the form has full rank. Howeve...
108
click to vote
ECBS
2003
IEEE
15 years 6 months ago
2003
IEEE
We present an algebraic framework for evidence exploration: the process of interpreting, manipulating, and navigating the proof structure or evidence produced by a model checker w...
110
click to vote
GI
2009
Springer
14 years 11 months ago
2009
Springer
Abstract: The work presented in this article generalizes the modeling of task scheduling problems with sequence dependent setup time on the basis of task scheduling on single respe...
144
click to vote
TCS
2010
14 years 11 months ago
2010
We consider a graph-theoretical formalization of the process of gene assembly in ciliates introduced in Ehrenfeucht et al (2003), where a gene is modeled as a signed graph. The ge...
GECCO
2006
Springer
15 years 5 months ago
2006
Springer
A genomic computing network is a variant of a neural network for which a genome encodes all aspects, both structural and functional, of the network. The genome is evolved by a gen...