Sciweavers

940 search results - page 88 / 188
» Control Abstractions for Local Search
Sort
View
CEC
2005
IEEE
16 years 10 days ago
Evolving binary decision diagrams using implicit neutrality
Abstract- A new algorithm is presented for evolving Binary Decision Diagrams (BDD) that employs the neutrality implicit in the BDD representation. It is shown that an effortless ne...
Richard M. Downing
CVBIA
2005
Springer
16 years 7 days ago
Registration of PET and MR Hand Volumes Using Bayesian Networks
Abstract. A method for the non-rigid, multi-modal, registration of volumetric scans of human hands is presented. PET and MR scans are aligned by optimising the configuration of a ...
Derek R. Magee, Steven Tanner, Michael Waller, Den...
203
Voted
ANTSW
2004
Springer
16 years 3 days ago
A Comparison Between ACO Algorithms for the Set Covering Problem
Abstract. In this paper we present a study of several Ant Colony Optimization (ACO) algorithms for the Set Covering Problem. In our computational study we emphasize the influence ...
Lucas Lessing, Irina Dumitrescu, Thomas Stütz...
GECCO
2004
Springer
16 years 2 days ago
Upper Bounds on the Time and Space Complexity of Optimizing Additively Separable Functions
Abstract. We present upper bounds on the time and space complexity of finding the global optimum of additively separable functions, a class of functions that has been studied exten...
Matthew J. Streeter
SAT
2004
Springer
111views Hardware» more  SAT 2004»
16 years 1 days ago
A Note on Satisfying Truth-Value Assignments of Boolean Formulas
Abstract. In this paper we define a class of truth-value assignments, called bounded assignments, using a certain substitutional property. We show that every satisfiable Boolean ...
Zbigniew Stachniak