152 search results - page 5 / 31 » An Experimental Study of Random Knapsack Problems |
RECOMB
2004
Springer
14 years 7 months ago
2004
Springer
In nature, one finds large collections of different protein sequences exhibiting roughly the same three-dimensional structure, and this observation underpins the study of structur...
CEC
2005
IEEE
14 years 10 days ago
2005
IEEE
Several approaches have been developed into evolutionary algorithms to deal with dynamic optimization problems, of which memory and random immigrants are two major schemes. This pa...
SLS
2007
Springer
14 years 24 days ago
2007
Springer
Abstract. This work presents an algorithm for the sub-graph isomorphism problem based on a new pruning technique for directed graphs. During the tree search, the method checks if a...
CONSTRAINTS
1998
13 years 6 months ago
1998
Many temporal applications like planning and scheduling can be viewed as special cases of the numeric and symbolic temporal constraint satisfaction problem. Thus we have developed ...
CPAIOR
2006
Springer
13 years 10 months ago
2006
Springer
This paper considers online stochastic reservation problems, where requests come online and must be dynamically allocated to limited resources in order to maximize profit. Multi-k...