Sciweavers

3250 search results - page 128 / 650
» An Algorithm to Solve a Linear Program
Sort
View
AIEDAM
2008
127views more  AIEDAM 2008»
15 years 5 months ago
Evolving blackbox quantum algorithms using genetic programming
Although it is known that quantum computers can solve certain computational problems exponentially faster than classical computers, only a small number of quantum algorithms have ...
Ralf Stadelhofer, Wolfgang Banzhaf, Dieter Suter
GECCO
2008
Springer
148views Optimization» more  GECCO 2008»
15 years 6 months ago
Combining cartesian genetic programming with an estimation of distribution algorithm
This paper describes initial testing of a novel idea to combine a CGP with an EDA. In recent work a new improved crossover technique was successfully applied to a CGP. To implemen...
Janet Clegg
RECOMB
2009
Springer
15 years 12 months ago
Pseudo Boolean Programming for Partially Ordered Genomes
Comparing genomes of different species is a crucial problem in comparative genomics. Different measures have been proposed to compare two genomes: number of common intervals, num...
Sébastien Angibaud, Guillaume Fertin, Annel...
155
Voted
ECWEB
2003
Springer
104views ECommerce» more  ECWEB 2003»
15 years 10 months ago
e-Procurement Using Goal Programming
Abstract. e-Procurement is an Internet-based business process for obtaining materials and services and managing their inflow into the organization. In this paper we develop multia...
S. Kameshwaran, Y. Narahari
129
Voted
CORR
2008
Springer
111views Education» more  CORR 2008»
15 years 3 months ago
Concave Programming Upper Bounds on the Capacity of 2-D Constraints
The capacity of 1-D constraints is given by the entropy of a corresponding stationary maxentropic Markov chain. Namely, the entropy is maximized over a set of probability distribut...
Ido Tal, Ron M. Roth