2638 search results - page 458 / 528 » Random Geometric Complexes |
FOCS
2004
IEEE
13 years 12 months ago
2004
IEEE
Let p > 1 be any fixed real. We show that assuming NP RP, there is no polynomial time algorithm that approximates the Shortest Vector Problem (SVP) in p norm within a constant ...
CP
2006
Springer
13 years 12 months ago
2006
Springer
Dynamic detection and elimination of symmetry in constraints, is in general a hard task, but in Not-Equals binary constraint networks, the symmetry conditions can be simplified. I...
EWCBR
2006
Springer
13 years 11 months ago
2006
Springer
Feature selection algorithms can reduce the high dimensionality of textual cases and increase case-based task performance. However, conventional algorithms (e.g., information gain)...
GECCO
2006
Springer
13 years 11 months ago
2006
Springer
Evolutionary algorithms tend to produce solutions that are not evolvable: Although current fitness may be high, further search is impeded as the effects of mutation and crossover ...
GECCO
2006
Springer
13 years 11 months ago
2006
Springer
Memetic algorithms are evolutionary algorithms incorporating local search to increase exploitation. This hybridization has been fruitful in countless applications. However, theory...