1187 search results - page 148 / 238 » The Generalized Dimensionality Reduction Problem |
GECCO
2008
Springer
14 years 11 months ago
2008
Springer
Our previous work has introduced a hyperheuristic (HH) approach based on Genetic Programming (GP). There, GP employs usergiven languages where domain-specific local heuristics ar...
COCO
2007
Springer
15 years 4 months ago
2007
Springer
We make progress in understanding the complexity of the graph reachability problem in the context of unambiguous logarithmic space computation; a restricted form of nondeterminism....
103
click to vote
COMPGEOM
2010
ACM
15 years 2 months ago
2010
ACM
A graph is near-planar if it can be obtained from a planar graph by adding an edge. We show that it is NP-hard to compute the crossing number of near-planar graphs. The main idea ...
TALG
2010
14 years 8 months ago
2010
We study the lower-bounded facility location problem, which generalizes the classical uncapacitated facility location problem in that it comes with lower bound constraints for the...
TSP
2010
14 years 4 months ago
2010
This paper considers the downlink beamforming optimization problem that minimizes the total transmission power subject to global shaping constraints and individual shaping constrai...