13376 search results - page 275 / 2676 » Problem Solving with |
134
click to vote
HICSS
2005
IEEE
15 years 9 months ago
2005
IEEE
In this paper we formulate a combinatorial auction brokering problem as a set packing problem and apply a simulated annealing heuristic with hybrid local moves to solve the proble...
110
click to vote
IJCAI
1993
15 years 5 months ago
1993
This paper introduces GSSS (Genetic State-Space Search). The integration of two general search paradigms — genetic search and state-space-search provides a general framework whi...
120
click to vote
RECOMB
2001
Springer
16 years 4 months ago
2001
Springer
Hidden Markov models (HMMs) have been successfully applied to a variety of problems in molecular biology, ranging from alignment problems to gene nding and annotation. Alignment p...
166
click to vote
STACS
1994
Springer
15 years 7 months ago
1994
Springer
The complexity of the simple maxcut problem is investigated for several special classes of graphs. It is shown that this problem is NP-complete when restricted to one of the follo...
138
click to vote
IWPEC
2009
Springer
15 years 10 months ago
2009
Springer
Given an undirected graph with n nodes, the Maximum Leaf Spanning Tree problem is to find a spanning tree with as many leaves as possible. When parameterized in the number of leav...