4940 search results - page 116 / 988 » On the Complexity of Universal Programs |
132
click to vote
FUIN
2007
15 years 4 months ago
2007
Abstract. Our previous research presents a methodology of cooperative problem solving for beliefdesire-intention (BDI) systems, based on a complete formal theory called TEAMLOG. Th...
141
click to vote
SIAMDM
2002
15 years 4 months ago
2002
A quorum system is a collection of sets (quorums) every two of which intersect. Quorum systems have been used for many applications in the area of distributed systems, including mu...
132
click to vote
COCO
2005
Springer
15 years 10 months ago
2005
Springer
We study the complexity of solving succinct zero-sum games, i.e., the games whose payoff matrix M is given implicitly by a Boolean circuit C such that M(i, j) = C(i, j). We comple...
151
Voted
ISMB
1993
15 years 6 months ago
1993
Understanding self-replication from an information processing perspective is important because, amongother things, it can shed light on molecular mechanismsof biological reproduct...
138
click to vote
AI
2010
Springer
15 years 4 months ago
2010
Springer
We consider the problem of finding an unknown graph by using two types of queries with an additive property. Given a graph, an additive query asks the number of edges in a set of ...