2657 search results - page 84 / 532 » On the complexity of hierarchical problem solving |
119
click to vote
GECCO
2007
Springer
15 years 7 months ago
2007
Springer
In the longest common subsequence problem the task is to find the longest sequence of letters that can be found as subsequence in all members of a given finite set of sequences....
136
click to vote
COR
2011
2011
An improved multi-objective evolutionary algorithm for the vehicle routing problem with time windows
14 years 8 months ago
The Vehicle Routing Problem with Time Windows is a complex combinatorial problem with many real-world applications in transportation and distribution logistics. Its main objective...
139
click to vote
IDA
2009
Springer
14 years 11 months ago
2009
Springer
Abstract. Independent Subspace Analysis (ISA) is an extension of Independent Component Analysis (ICA) that aims to linearly transform a random vector such as to render groups of it...
111
click to vote
ECML
2005
Springer
15 years 7 months ago
2005
Springer
Constraint programming is rapidly becoming the technology of choice for modelling and solving complex combinatorial problems. However, users of this technology need significant ex...
CJ
2010
15 years 1 months ago
2010
How best to quantify the information of an object, whether natural or artifact, is a problem of wide interest. A related problem is the computability of an object. We present prac...