1650 search results - page 180 / 330 » The HOM problem is decidable |
136
click to vote
IGPL
2006
15 years 4 months ago
2006
Since 1996, some models of recursive functions over the real numbers have been analyzed by several researchers. It could be expected that they exhibit a computational power much g...
155
click to vote
IOR
2008
15 years 4 months ago
2008
The stochastic knapsack has been used as a model in wide ranging applications from dynamic resource allocation to admission control in telecommunication. In recent years, a variat...
130
click to vote
IJCV
2006
15 years 4 months ago
2006
: Shape recognition is the field of computer vision which addresses the problem of finding out whether a query shape lies or not in a shape database, up to a certain invariance. Mo...
126
click to vote
JGAA
2006
15 years 4 months ago
2006
Let G = (V, E) be a graph with n vertices and let P be a set of n points in the plane. We show that deciding whether there is a planar straight-line embedding of G such that the v...
164
click to vote
ENTCS
2007
15 years 4 months ago
2007
Bounded Model Checking (BMC) is a successful refutation method to detect errors in not only circuits and other binary systems but also in systems with more complex domains like ti...