2165 search results - page 155 / 433 » cases 2005 |
108
click to vote
TARK
2005
Springer
15 years 9 months ago
2005
Springer
Two natural strategy elimination procedures have been studied for strategic games. The first one involves the notion of (strict, weak, etc) dominance and the second the notion of...
114
click to vote
TLCA
2005
Springer
15 years 9 months ago
2005
Springer
We use a fully abstract denotational model to show that nested function calls and recursive definitions can be eliminated from SPCF (a typed functional language with simple non-lo...
105
click to vote
WIA
2005
Springer
15 years 9 months ago
2005
Springer
There has been several attempts over the years to solve the bisimulation minimization problem for finite automata. One of the most famous algorithms is the one suggested by Paige ...
142
click to vote
BVAI
2005
Springer
15 years 9 months ago
2005
Springer
Inspired by psychophysical studies of the human cognitive abilities we propose a novel aspect and a method for performance evaluation of contour based shape recognition algorithms ...
121
click to vote
GD
2004
Springer
15 years 9 months ago
2004
Springer
Consider the following question: does every complete geometric graph K2n have a partition of its edge set into n plane spanning trees? We approach this problem from three directio...