1653 search results - page 178 / 331 » Computer science and game theory |
69
Voted
RTA
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. We extend first-order order-sorted unification by permitting regular expression sorts for variables and in the domains of function symbols. The set of basic sorts is ...
CCA
2000
Springer
15 years 2 months ago
2000
Springer
Abstract. General methods of investigating effectivity on regular Hausdorff (T3) spaces is considered. It is shown that there exists a functor from a category of T3 spaces into a c...
GG
2008
Springer
14 years 11 months ago
2008
Springer
Abstract Synchronising Graphs is a system of parallel graph transformation designed for modeling process interaction in a network environment. We propose a theory of context-free s...
DLT
2009
14 years 8 months ago
2009
While a mature theory around logics such as MSO, LTL, and CTL has been developed in the pure boolean setting of finite automata, weighted automata lack such a natural connection wi...
106
click to vote
SAGT
2009
Springer
15 years 5 months ago
2009
Springer
Abstract. A mechanism is manipulable if it is in some agents’ best interest to misrepresent their private information. The revelation principle establishes that, roughly, anythin...