Sciweavers

4526 search results - page 114 / 906
» Algorithmic problems related to the Internet
Sort
View
WADS
2005
Springer
122views Algorithms» more  WADS 2005»
15 years 9 months ago
Parameterized Complexity of Generalized Vertex Cover Problems
Important generalizations of the Vertex Cover problem (Connected Vertex Cover, Capacitated Vertex Cover, and Maximum Partial Vertex Cover) have been intensively studied in terms of...
Jiong Guo, Rolf Niedermeier, Sebastian Wernicke
ECCV
2008
Springer
16 years 6 months ago
Belief Propagation with Directional Statistics for Solving the Shape-from-Shading Problem
The Shape-from-Shading [SfS] problem infers shape from reflected light, collected using a camera at a single point in space only. Reflected light alone does not provide sufficient ...
Tom S. F. Haines, Richard C. Wilson
AE
2007
Springer
15 years 10 months ago
A Study of Evaluation Functions for the Graph K-Coloring Problem
The evaluation or fitness function is a key component of any heuristic search algorithm. This paper introduces a new evaluation function for the well-known graph K-coloring proble...
Daniel Cosmin Porumbel, Jin-Kao Hao, Pascale Kuntz
AE
1999
Springer
15 years 8 months ago
Characterizing Locality in Decoder-Based EAs for the Multidimensional Knapsack Problem
The performance of decoder-based evolutionary algorithms (EAs) strongly depends on the locality of the used decoder and operators. While many approaches to characterize locality ar...
Jens Gottlieb, Günther R. Raidl
GCB
2000
Springer
75views Biometrics» more  GCB 2000»
15 years 7 months ago
Regexpcount, a Symbolic Package for Counting Problems on Regular Expressions and Words
In previous work [10], we considered algorithms related to the statistics of matches with words and regular expressions in texts generated by Bernoulli or Markov sources. In this w...
Pierre Nicodème