604 search results - page 49 / 121 » On the Complexity of the Maximum Cut Problem |
165
click to vote
GECCO
2007
Springer
15 years 12 months ago
2007
Springer
The Second Harmonic Generation (SHG), a process that turns out to be a good test case in the physics lab, can also be considered as a fairly simple theoretical test function for g...
231
click to vote
ALGORITHMICA
2011
15 years 25 days ago
2011
Let G = (V, E, w) be a directed graph, where w : V → R is an arbitrary weight function defined on its vertices. The bottleneck weight, or the capacity, of a path is the smalles...
150
click to vote
ICML
2004
IEEE
16 years 6 months ago
2004
IEEE
Learning general functional dependencies is one of the main goals in machine learning. Recent progress in kernel-based methods has focused on designing flexible and powerful input...
130
click to vote
WWW
2005
ACM
16 years 6 months ago
2005
ACM
We introduce a stricter Web community definition to overcome boundary ambiguity of a Web community defined by Flake, Lawrence and Giles [2], and consider the problem of finding co...
161
click to vote
MP
2006
15 years 5 months ago
2006
Mixed integer programming (MIP) formulations are typically tightened through the use of a separation algorithm and the addition of violated cuts. Using extended formulations involv...