Sciweavers

3299 search results - page 116 / 660
» A general mathematics of names
Sort
View
ISIPTA
1999
IEEE
114views Mathematics» more  ISIPTA 1999»
15 years 10 months ago
Lower Desirability Functions: A Convenient Imprecise Hierarchical Uncertainty Model
I introduce and study a fairly general imprecise secondorder uncertainty model, in terms of lower desirability. A modeller's lower desirability for a gamble is defined as her...
Gert De Cooman
ISIPTA
1999
IEEE
134views Mathematics» more  ISIPTA 1999»
15 years 10 months ago
Conditional Independence Relations in Possibility Theory
The aim of this paper is to survey and brie y discuss various rules of conditioning proposed in the framework of possibility theory as well as various conditional independence rel...
Jirina Vejnarová
SIBGRAPI
1999
IEEE
15 years 10 months ago
Developing Morphological Building Blocks: From Design to Implementation
Abstract. Mathematical morphology has become a widely used technique for image processing and computer vision. Initially designed as a set theory, it was generalized to the set of ...
Marcos Cordeiro d'Ornellas, Rein van den Boomgaard
GECCO
2006
Springer
161views Optimization» more  GECCO 2006»
15 years 10 months ago
Instance similarity and the effectiveness of case injection in a genetic algorithm for binary quadratic programming
When an evolutionary algorithm addresses a sequence of instances of the same problem, it can seed its population with solutions that it found for previous instances. This techniqu...
Jason Amunrud, Bryant A. Julstrom
GECCO
2006
Springer
282views Optimization» more  GECCO 2006»
15 years 10 months ago
A genetic algorithm for the longest common subsequence problem
A genetic algorithm for the longest common subsequence problem encodes candidate sequences as binary strings that indicate subsequences of the shortest or first string. Its fitnes...
Brenda Hinkemeyer, Bryant A. Julstrom