91 search results - page 16 / 19 » Computational RNA secondary structure design: empirical comp... |
ATAL
2006
Springer
15 years 3 months ago
2006
Springer
Distributing scarce resources among agents in a way that maximizes the social welfare of the group is a computationally hard problem when the value of a resource bundle is not lin...
100
click to vote
INFOCOM
2006
IEEE
15 years 5 months ago
2006
IEEE
— Internet paths sharing the same bottleneck can be identified using several shared congestion detection techniques. However, all of these techniques have been designed to detec...
130
click to vote
KSEM
2010
Springer
14 years 9 months ago
2010
Springer
Abstract. Ontology mapping is one of the most important tasks for ontology interoperability and its main aim is to find semantic relationships between entities (i.e. concept, attri...
COCO
2010
Springer
15 years 3 months ago
2010
Springer
Designing algorithms that use logarithmic space for graph reachability problems is fundamental to complexity theory. It is well known that for general directed graphs this problem...
110
click to vote
NC
1998
15 years 28 days ago
1998
In this paper we introduce an efficient implementation of asynchronously parallel genetic algorithm with adaptive genetic operators. The classic genetic algorithm paradigm is exte...