9842 search results - page 1385 / 1969 » The Complexity of the Matching-Cut Problem |
200
click to vote
GECCO
2005
Springer
16 years 21 days ago
2005
Springer
In Genetic algorithms it is not easy to evaluate the confidence level in whether a GA run may have missed a complete area of good points, and whether the global optimum was found....
200
click to vote
ISSAC
2005
Springer
16 years 21 days ago
2005
Springer
We reduce the problem of computing the rank and a nullspace basis of a univariate polynomial matrix to polynomial matrix multiplication. For an input n×n matrix of degree d over ...
166
click to vote
TACAS
2005
Springer
16 years 20 days ago
2005
Springer
Abstract. The automatic synthesis of programs from their specifications has been a dream of many researchers for decades. If we restrict to open finite-state reactive systems, th...
186
click to vote
WLP
2005
Springer
16 years 20 days ago
2005
Springer
Abstract. Combinatorial Auctions are an attractive application of intelligent agents; their applications are countless and are shown to provide good revenues. On the other hand, on...
199
click to vote
GECCO
2005
Springer
16 years 19 days ago
2005
Springer
The problem of pedestrian injury is a significant one throughout the world. In 2001, there were 4724 pedestrian fatalities in Europe and 4882 in the US. Significant advances have ...