Sciweavers

1964 search results - page 28 / 393
» Partitioning Based Algorithms for Some Colouring Problems
Sort
View
ICFCA
2007
Springer
14 years 1 months ago
Some Notes on Pseudo-closed Sets
Pseudo-intents (also called pseudo-closed sets) of formal contexts have gained interest in recent years, since this notion is helpful for finding minimal representations of impli...
Sebastian Rudolph
BMCBI
2006
141views more  BMCBI 2006»
13 years 7 months ago
Maximum common subgraph: some upper bound and lower bound results
Background: Structure matching plays an important part in understanding the functional role of biological structures. Bioinformatics assists in this effort by reformulating this p...
Xiuzhen Huang, Jing Lai, Steven F. Jennings
IROS
2007
IEEE
254views Robotics» more  IROS 2007»
14 years 2 months ago
3D datasets segmentation based on local attribute variation
— We present a Graph-based method for low-level segmentation of unfiltered 3D data. The core of this approach is based on the construction of a local neighborhood structure and ...
Carla Silva Rocha Aguiar, Sébastien Druon, ...
AUSAI
2004
Springer
14 years 1 months ago
A Learning-Based Algorithm Selection Meta-reasoner for the Real-Time MPE Problem
Abstract. The algorithm selection problem aims to select the best algorithm for an input problem instance according to some characteristics of the instance. This paper presents a l...
Haipeng Guo, William H. Hsu
ENGL
2007
121views more  ENGL 2007»
13 years 7 months ago
A Comparison between Genetic Algorithms and Evolutionary Programming based on Cutting Stock Problem
—Genetic Algorithms (GA) and Evolutionary Programming (EP) are two well-known optimization methods that belong to the class of Evolutionary Algorithms (EA). Both methods have gen...
Raymond Chiong, Ooi Koon Beng