1816 search results - page 15 / 364 » A New Approach for Solving the Maximum Clique Problem |
CCCG
2007
15 years 1 months ago
2007
Given a sequence of n real numbers a1, a2, a3, . . . , an, the maximum segment sum problem is that of determining indices i and j (1 ≤ i ≤ j ≤ n) such that the sum s(i, j) =...
102
click to vote
NIPS
2004
15 years 1 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, ...
102
click to vote
FUN
2007
Springer
15 years 3 months ago
2007
Springer
Architectures for optical processors designed to solve bounded instances of NP-Complete problems are suggested. One approach mimics the traveling salesman by traveling beams that ...
EOR
2007
2007
Solving the short-term electrical generation scheduling problem by an adaptive evolutionary approach
14 years 11 months ago
In this paper, we introduce an adaptive evolutionary approach to solve the short-term electrical generation scheduling problem (STEGS). The STEGS is a hard constraint satisfaction...
101
click to vote
EAAI
2007
14 years 11 months ago
2007
Multi-agent systems are widely used to address large-scale distributed combinatorial applications in the real world. One such application is meeting scheduling (MS), which is deï¬...