526 search results - page 37 / 106 » Generalized benchmark generation for dynamic combinatorial p... |
CODES
2007
IEEE
15 years 4 months ago
2007
IEEE
We address the problem of instruction selection for Multi-Output Instructions (MOIs), producing more than one result. Such inherently parallel hardware instructions are very commo...
ESA
1998
Springer
15 years 1 months ago
1998
Springer
In this paper, we study a class of optimal path problems with the following phenomenon: The space complexity of the algorithms for reporting the lengths of single-source optimal pa...
CP
2006
Springer
15 years 1 months ago
2006
Springer
Many combinatorial problems, such as car sequencing and rostering, feature sequence constraints, restricting the number of occurrences of certain values in every subsequence of a g...
GECCO
2005
Springer
15 years 3 months ago
2005
Springer
This paper presents the Real-coded Genetic Algorithms for high-dimensional ill-scaled structures, what is called, the ktablet structure. The k-tablet structure is the landscape th...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
Artificial neural networks (ANNs) have been successfully applied to solve a variety of classification and function approximation problems. Although ANNs can generally predict bett...