5964 search results - page 341 / 1193 » A theory of speculative computation |
216
Voted
Presentation
This presentation was given as part of theory seminars @ Dept of CSA, Indian Institute of Science, Bangalore. This talk explains about assignment problem and why mechanism design i...
144
Voted
KBS
2006
15 years 7 months ago
2006
Dialogic argumentation is a crucial component in many computational domains, and forms a core component of argumentation theory. This paper compares two approaches to dialogue tha...
208
Voted
CAV
2012
Springer
13 years 10 months ago
2012
Springer
Abstract. A minimum satisfying assignment of a formula is a minimumcost partial assignment of values to the variables in the formula that guarantees the formula is true. Minimum sa...
179
Voted
ICEGOV
2009
ACM
16 years 2 months ago
2009
ACM
With presumptions that e-government theories prevail in various formats and concepts around the globe, nations and institutions, not many examples are there to emulate in terms of...
185
click to vote
CALCO
2007
Springer
16 years 1 months ago
2007
Springer
In formal language theory, James Rogers published a series of innovative papers generalising strings and trees to higher dimensions.Motivated by applications in linguistics, his go...