Sciweavers

3946 search results - page 657 / 790
» The computational complexity of choice sets
Sort
View
161
Voted
GECCO
2007
Springer
154views Optimization» more  GECCO 2007»
16 years 1 months ago
Finding critical backbone structures with genetic algorithms
This paper introduces the concept of a critical backbone as a minimal set of variables or part of the solution necessary to be within the basin of attraction of the global optimum...
Adam Prügel-Bennett
GECCO
2007
Springer
193views Optimization» more  GECCO 2007»
16 years 1 months ago
Approximating covering problems by randomized search heuristics using multi-objective models
The main aim of randomized search heuristics is to produce good approximations of optimal solutions within a small amount of time. In contrast to numerous experimental results, th...
Tobias Friedrich, Nils Hebbinghaus, Frank Neumann,...
POLICY
2007
Springer
16 years 1 months ago
A Socio-cognitive Approach to Modeling Policies in Open Environments
The richness of today’s electronic communications mirrors physical world: activities such as shopping, business and scientific collaboration are conducted online. Current intera...
Tatyana Ryutov
183
Voted
SCIA
2007
Springer
111views Image Analysis» more  SCIA 2007»
16 years 1 months ago
Scale-Space Texture Classification Using Combined Classifiers
Abstract. Since texture is scale dependent, multi-scale techniques are quite useful for texture classification. Scale-space theory introduces multi-scale differential operators. In...
Mehrdad J. Gangeh, Bart M. ter Haar Romeny, C. Esw...
145
Voted
WADS
2007
Springer
68views Algorithms» more  WADS 2007»
16 years 1 months ago
On Euclidean Vehicle Routing with Allocation
The (Euclidean) Vehicle Routing Allocation Problem (VRAP) is a generalization of Euclidean TSP. We do not require that all points lie on the salesman tour. However, points that do ...
Jan Remy, Reto Spöhel, Andreas Weißl