2877 search results - page 301 / 576 » The Complexity of Planarity Testing |
180
click to vote
CEC
2009
IEEE
15 years 11 months ago
2009
IEEE
— This work presents a methodology for the application of a parallel genetic algorithm (PGA) to the problem of protein folding prediction, using the 3DHP-Side Chain model. This m...
192
click to vote
CAV
2001
Springer
15 years 11 months ago
2001
Springer
In this paper we show how the classical job-shop scheduling problem can be modeled as a special class of acyclic timed automata. Finding an optimal schedule corresponds, then, to n...
164
Voted
FUZZY
2001
Springer
15 years 11 months ago
2001
Springer
This work studies the edge-based representation of directed acyclic graphs, as well as the properties of recombination operators working on it. It is shown that this representation...
158
click to vote
MLDM
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. This paper proposes a general local learning framework to effectively alleviate the complexities of classifier design by means of “divide and conquer” principle and ...
156
click to vote
ICRA
2000
IEEE
15 years 11 months ago
2000
IEEE
The need for high precision robotic systems has increased in recent years. Examples include automated assembly of complex electro-mechanical products such as disk drives, cameras,...