3946 search results - page 5 / 790 » The computational complexity of choice sets |
RSFDGRC
2005
Springer
14 years 28 days ago
2005
Springer
Pawlak recently introduced rough set flow graphs (RSFGs) as a graphical framework for reasoning from data. Each rule is associated with three coefficients, which have been shown t...
BSL
2008
13 years 7 months ago
2008
The goal of this paper is to announce there is a single orbit of the c.e. sets with inclusion, E, such that the question of membership in this orbit is 1 1-complete. This result an...
TCS
1998
13 years 7 months ago
1998
The complexity of the reachability problem for live and safe free-choice Petri nets has been open for several years. Several partial results seemed to indicate that the problem is...
ATAL
2010
Springer
13 years 8 months ago
2010
Springer
Aggregating the judgments of a group of agents regarding a set of interdependent propositions can lead to inconsistent outcomes. One of the parameters involved is the agenda, the ...
BMVC
2010
13 years 5 months ago
2010
Variational level set methods are formulated as energy minimisation problems, which are often solved by gradient-based optimisation methods, such as gradient descent. Unfortunatel...