Sciweavers

3019 search results - page 185 / 604
» Approximating the Domatic Number
Sort
View
APPROX
2004
Springer
117views Algorithms» more  APPROX 2004»
15 years 11 months ago
The Greedy Algorithm for the Minimum Common String Partition Problem
In the Minimum Common String Partition problem (MCSP) we are given two strings on input, and we wish to partition them into the same collection of substrings, minimizing the numbe...
Marek Chrobak, Petr Kolman, Jiri Sgall
CP
2004
Springer
15 years 11 months ago
Counting-Based Look-Ahead Schemes for Constraint Satisfaction
Abstract. The paper presents a new look-ahead scheme for backtracking search for solving constraint satisfaction problems. This look-ahead scheme computes a heuristic for value ord...
Kalev Kask, Rina Dechter, Vibhav Gogate
ICML
2003
IEEE
15 years 11 months ago
The Significance of Temporal-Difference Learning in Self-Play Training TD-Rummy versus EVO-rummy
Reinforcement learning has been used for training game playing agents. The value function for a complex game must be approximated with a continuous function because the number of ...
Clifford Kotnik, Jugal K. Kalita
VISUALIZATION
2002
IEEE
15 years 11 months ago
Efficient Simplification of Point-Sampled Surfaces
In this paper we introduce, analyze and quantitatively compare a number of surface simplification methods for point-sampled geometry. We have implemented incremental and hierarchi...
Mark Pauly, Markus H. Gross, Leif Kobbelt
PCI
2001
Springer
15 years 10 months ago
An Experimental Evaluation of a Monte-Carlo Algorithm for Singular Value Decomposition
We demonstrate that an algorithm proposed by Drineas et. al. in [7] to approximate the singular vectors/values of a matrix A, is not only of theoretical interest but also a fast, v...
Petros Drineas, Eleni Drinea, Patrick S. Huggins