1650 search results - page 167 / 330 » The HOM problem is decidable |
114
click to vote
ICALP
2010
Springer
15 years 9 months ago
2010
Springer
We show that the downward-closure of a Petri net language is effectively computable. This is mainly done by using the notions defined for showing decidability of the reachability...
140
click to vote
SUM
2009
Springer
15 years 9 months ago
2009
Springer
We propose a framework to compute the utility of an agreement w.r.t. a preference set in a negotiation process. In particular, we refer to preferences expressed as weighted formula...
129
click to vote
IWANN
2001
Springer
15 years 9 months ago
2001
Springer
Complexity-penalization strategies are one way to decide on the most appropriate network size in order to address the trade-off between overfitted and underfitted models. In this p...
136
click to vote
MCS
2001
Springer
15 years 9 months ago
2001
Springer
For learning purposes, representations of real world objects can be built by using the concept of dissimilarity (distance). In such a case, an object is characterized in a relative...
178
click to vote
RANDOM
2001
Springer
15 years 9 months ago
2001
Springer
We consider the problem of determining whether a given function ¢ £ ¤¥ ¦ §¨© ¤¥ ¦ §¨ belongs to a certain class of Boolean functions or whether it is far from the...