2089 search results - page 198 / 418 » A New Problem in String Searching |
AAAI
2007
15 years 5 months ago
2007
Various tasks in decision making and decision support require selecting a preferred subset of items from a given set of feasible items. Recent work in this area considered methods...
124
click to vote
CPAIOR
2008
Springer
15 years 4 months ago
2008
Springer
Abstract. The multiple knapsack problem (MKP) is a classical combinatorial optimization problem. A recent algorithm for some classes of the MKP is bin-completion, a bin-oriented, b...
112
click to vote
AAAI
1996
15 years 4 months ago
1996
GSAT is a randomized greedy local repair procedure that was introduced for solving propositional satis ability and constraint satisfaction problems. We present an improvement to G...
126
click to vote
AI
2010
Springer
15 years 3 months ago
2010
Springer
The subgraph isomorphism problem involves deciding if there exists a copy of a pattern graph in a target graph. This problem may be solved by a complete tree search combined with ...
160
click to vote
GECCO
2009
Springer
15 years 9 months ago
2009
Springer
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising, for example, in network design when quality of service is of concern. ...