1529 search results - page 41 / 306 » A slant removal algorithm |
100
Voted
FLAIRS
2004
15 years 2 months ago
2004
Constraint satisfaction technology emerged from AI research. Its practical success is based on integration of sophisticated search with consistency techniques reducing the search ...
114
click to vote
CORR
2007
Springer
15 years 16 days ago
2007
Springer
We prove that the single-player game clobber is solvable in linear time when played on a line or on a cycle. For this purpose, we show that this game is equivalent to an optimizat...
96
Voted
NETWORKS
2008
15 years 15 days ago
2008
Node pruning is a commonly used technique for solution acceleration in a dynamic programming network. In pruning, nodes are adaptively removed from the dynamic programming network...
108
click to vote
ESA
2001
Springer
15 years 5 months ago
2001
Springer
Abstract. Single nucleotide polymorphisms (SNPs) are the most frequent form of human genetic variation. They are of fundamental importance for a variety of applications including m...
90
Voted
FUIN
2007
15 years 15 days ago
2007
Abstract. In the paper two notions related to local (distributed) computations are identified and discussed. The first one is the notion of reducible graphs. A graph is reducible...