592 search results - page 11 / 119 » Using Constraint Programming to Solve the Maximum Clique Pro... |
IEAAIE
2001
Springer
15 years 1 months ago
2001
Springer
Scheduling problems can be seen as a set of temporal metric and disjunctive constraints. So, they can be formulated in terms of CSPs techniques. In the literature, there are CSP-b...
NIPS
2004
14 years 11 months ago
2004
We propose a new method for clustering based on finding maximum margin hyperplanes through data. By reformulating the problem in terms of the implied equivalence relation matrix, ...
IDA
2005
Springer
15 years 3 months ago
2005
Springer
In this paper we introduce a simple ant based algorithm for solving a copper mine planning problem. In the last 10 years this realworld problem has been tackled using linear intege...
ICWL
2007
Springer
15 years 3 months ago
2007
Springer
Intelligent Tutoring Systems have made great strides in recent years. Many of these gains have been achieved for welldefined problems. However, solving ill-defined problems is imp...
80
Voted
FUIN
2010
14 years 8 months ago
2010
Given a set of taxa S and a complete set of quartet topologies Q over S, the problem of determining a phylogeny that satisfies the maximum number of topologies is called the Maxi...