146 search results - page 7 / 30 » Computably Enumerable Sets and Quasi-Reducibility |
100
click to vote
COMPGEOM
1995
ACM
15 years 3 months ago
1995
ACM
A convex polytope P can be speci ed in two ways: as the convex hull of the vertex set V of P, or as the intersection of the set H of its facet-inducing halfspaces. The vertex enum...
105
click to vote
TCS
2011
14 years 6 months ago
2011
We propose a formal definition of Wolfram’s notion of computational process based on iterated transducers together with a weak observer, a model of computation that captures so...
100
click to vote
ICTAI
2006
IEEE
15 years 5 months ago
2006
IEEE
We propose a formulation of a general-sum bimatrix game as a bipartite directed graph with the objective of establishing a correspondence between the set of the relevant structure...
CORR
2004
Springer
14 years 11 months ago
2004
Springer
In this paper we introduce a fuzzy version of symport/antiport membrane systems. Our fuzzy membrane systems handle possibly inexact copies of reactives and their rules are endowed...
AAAI
2007
15 years 2 months ago
2007
Various tasks in decision making and decision support require selecting a preferred subset of items from a given set of feasible items. Recent work in this area considered methods...