Sciweavers

184 search results - page 31 / 37
» A New Algorithm of Constructing the Basis Finite Automaton
Sort
View
EMO
2006
Springer
87views Optimization» more  EMO 2006»
14 years 9 days ago
Symbolic Archive Representation for a Fast Nondominance Test
Abstract. Archives are used in Multi-Objective Evolutionary Algorithms to establish elitism. Depending on the optimization problem, an unconstrained archive may grow to an immense ...
Martin Lukasiewycz, Michael Glaß, Christian ...
BMCBI
2006
114views more  BMCBI 2006»
13 years 8 months ago
A high level interface to SCOP and ASTRAL implemented in Python
Background: Benchmarking algorithms in structural bioinformatics often involves the construction of datasets of proteins with given sequence and structural properties. The SCOP da...
James A. Casbon, Gavin E. Crooks, Mansoor A. S. Sa...
GECCO
2005
Springer
232views Optimization» more  GECCO 2005»
14 years 2 months ago
Factorial representations to generate arbitrary search distributions
A powerful approach to search is to try to learn a distribution of good solutions (in particular of the dependencies between their variables) and use this distribution as a basis ...
Marc Toussaint
EH
1999
IEEE
351views Hardware» more  EH 1999»
14 years 29 days ago
Evolvable Hardware or Learning Hardware? Induction of State Machines from Temporal Logic Constraints
Here we advocate an approach to learning hardware based on induction of finite state machines from temporal logic constraints. The method involves training on examples, constraint...
Marek A. Perkowski, Alan Mishchenko, Anatoli N. Ch...
CAD
2008
Springer
13 years 8 months ago
Polycube splines
This paper proposes a new concept of polycube splines and develops novel modeling techniques for using the polycube splines in solid modeling and shape computing. Polycube splines...
Hongyu Wang, Ying He 0001, Xin Li, Xianfeng Gu, Ho...