335 search results - page 10 / 67 » Solving the Hamiltonian path problem with a light-based comp... |
81
Voted
COMPGEOM
1999
ACM
15 years 1 months ago
1999
ACM
We show a remarkable fact about folding paper: From a single rectangular sheet of paper, one can fold it into a flat origami that takes the (scaled) shape of any connected polygo...
STACS
2010
Springer
15 years 4 months ago
2010
Springer
Testing whether there is an induced path in a graph spanning k given vertices is already NP-complete in general graphs when k = 3. We show how to solve this problem in polynomial t...
112
Voted
NIPS
2004
14 years 11 months ago
2004
The problem of learning a sparse conic combination of kernel functions or kernel matrices for classification or regression can be achieved via the regularization by a block 1-norm...
GECCO
2006
Springer
15 years 1 months ago
2006
Springer
In this paper, we propose a Genetic Algorithm (GA) approach using a new paths growth procedure by the random key-based encoding for solving Shortest Path Routing (SPR) problem. An...
77
Voted
IEEEPACT
2006
IEEE
15 years 3 months ago
2006
IEEE
A recent trend in computing are domain-specific program generators, designed to alleviate the effort of porting and reoptimizing libraries for fast-changing and increasingly com...