100 search results - page 19 / 20 » Solving the minimum-cost satisfiability problem using SAT ba... |
GECCO
2004
Springer
14 years 26 days ago
2004
Springer
Genetic Programming uses trees to represent chromosomes. The user defines the representation space by defining the set of functions and terminals to label the nodes in the trees....
IJAMCIGI
2010
13 years 4 months ago
2010
Hyper-heuristics are identified as the methodologies that search the space generated by a finite set of low level heuristics for solving difficult problems. One of the iterative h...
CP
1999
Springer
13 years 11 months ago
1999
Springer
In this paper we present a Lagrange-multiplier formulation of discrete constrained optimization problems, the associated discrete-space first-order necessary and sufficient condit...
GECCO
2009
Springer
13 years 5 months ago
2009
Springer
Public data sharing is utilized in a number of businesses to facilitate the exchange of information. Privacy constraints are usually enforced to prevent unwanted inference of info...
DATE
2006
IEEE
13 years 11 months ago
2006
IEEE
- Many electronic systems contain implementations of cryptographic algorithms in order to provide security. It is well known that cryptographic algorithms, irrespective of their th...