9842 search results - page 276 / 1969 » The Complexity of the Matching-Cut Problem |
103
click to vote
APPROX
2008
Springer
15 years 2 months ago
2008
Springer
We study the problem of local search on a graph. Given a real-valued black-box function f on the graph's vertices, this is the problem of determining a local minimum of f--a v...
88
Voted
APIN
2002
15 years 15 days ago
2002
This paper proposes a few steps to escape structured extensive representations for objects, in the context of evolutionary Topological Optimum Design (TOD) problems: early results ...
102
click to vote
ISORC
2006
IEEE
15 years 6 months ago
2006
IEEE
Embedded real-time systems are becoming increasingly complex due to ever increasing size and functionality so that complexity management is of growing importance, especially in de...
103
click to vote
IDEAL
2005
Springer
15 years 6 months ago
2005
Springer
The design, development, and use of complex systems models raises a unique class of challenges and potential pitfalls, many of which are commonly recurring problems. Over time, res...
116
Voted
ICC
2007
IEEE
15 years 7 months ago
2007
IEEE
This paper presents an analytical approach to evaluate the expected complexity of a generalized sphere decoding (GSD) algorithm, GSDλ − , for underdetermined integer leastsquare...