2944 search results - page 97 / 589 » Improving Bound Propagation |
115
click to vote
AAAI
2006
15 years 5 months ago
2006
Forward pruning, or selectively searching a subset of moves, is now commonly used in game-playing programs to reduce the number of nodes searched with manageable risk. Forward pru...
179
click to vote
OPODIS
2004
15 years 5 months ago
2004
Secure location verification is a recently stated problem that has a number of practical applications. The problem requires a wireless sensor network to confirm that a potentially...
138
click to vote
JEC
2006
15 years 4 months ago
2006
The paper addresses a novel method for realtime analysis of systems with cyclic data flows. The presented method is based on Network Calculus principles, where upper and lower flo...
130
click to vote
ESA
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. Possibly the most famous algorithmic meta-theorem is Courcelle's theorem, which states that all MSO-expressible graph properties are decidable in linear time for gra...
132
click to vote
COMPGEOM
2009
ACM
15 years 9 months ago
2009
ACM
The k-means algorithm is a well-known method for partitioning n points that lie in the d-dimensional space into k clusters. Its main features are simplicity and speed in practice....