1224 search results - page 225 / 245 » Theory decision by decomposition |
CSL
2004
Springer
14 years 4 months ago
2004
Springer
To reason effectively about programs, it is important to have some version of a transitive-closure operator so that we can describe such notions as the set of nodes reachable from ...
SIGECOM
2010
ACM
14 years 3 months ago
2010
ACM
One of the fundamental problems in the theory of social choice is aggregating the rankings of a set of agents (or voters) into a consensus ranking. Rank aggregation has found appl...
ECIS
2000
14 years 8 days ago
2000
The growing prominence of virtual organizations, such as Dell and Amazon.Com, has demonstrated the potential for virtual governance structures to achieve greater competitiveness th...
INFORMATICALT
2006
13 years 11 months ago
2006
The objective is to investigate two emerging information technologies in graduate studies and scientific cooperation. Internet is the first technology. The open source is the secon...
TOPLAS
2008
13 years 10 months ago
2008
lem of inferring termination from such abstract information is not the halting problem for programs and may well be decidable. If this is the case, the decision algorithm forms a &...