4131 search results - page 370 / 827 » The Generalized Max-Controlled Set Problem |
122
click to vote
ANOR
2010
15 years 5 months ago
2010
The design of effective neighborhood structures is fundamentally important for creating better local search and metaheuristic algorithms for combinatorial optimization. Significant...
147
click to vote
AUTOMATICA
2008
15 years 5 months ago
2008
This paper focuses on the NP-hard problem of reducing the complexity of piecewise polyhedral systems (e.g. polyhedral piecewise affine (PWA) systems). The results are fourfold. Fi...
121
click to vote
CORR
2008
Springer
15 years 5 months ago
2008
Springer
Since the inception of genetic algorithmics the identification of computational efficiencies of the simple genetic algorithm (SGA) has been an important goal. In this paper we dist...
162
click to vote
DAM
2008
15 years 5 months ago
2008
A transitive orientation of an undirected graph is an assignment of directions to its edges so that these directed edges represent a transitive relation between the vertices of th...
133
click to vote
CPC
2006
15 years 5 months ago
2006
Abstract. We show that a maximum cut of a random graph below the giantcomponent threshold can be found in linear space and linear expected time by a simple algorithm. In fact, the ...