941 search results - page 20 / 189 » The Parking Permit Problem |
129
Voted
COCOA
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. We study the complexity of several coloring problems on graphs, parameterized by the treewidth t of the graph: (1) The list chromatic number χl(G) of a graph G is defin...
121
Voted
EMO
2001
Springer
15 years 8 months ago
2001
Springer
One common characterization of how simple hill-climbing optimization methods can fail is that they become trapped in local optima - a state where no small modi cation of the curren...
179
Voted
KDD
2008
ACM
16 years 4 months ago
2008
ACM
The success of popular algorithms such as k-means clustering or nearest neighbor searches depend on the assumption that the underlying distance functions reflect domain-specific n...
127
Voted
TCBB
2008
15 years 3 months ago
2008
Abstract-- The trans-genomic query (TGQ) problem -- enabling the free query of biological information, even across genomes -- is a central challenge facing bioinformatics. Solution...
130
Voted
TOC
2008
15 years 3 months ago
2008
Abstract: Schnorr's algorithm for finding an approximation for the shortest nonzero vector in an n-dimensional lattice depends on a parameter k. He proved that for a fixed k ...