1653 search results - page 263 / 331 » Computer science and game theory |
143
click to vote
WWW
2006
ACM
16 years 7 months ago
2006
ACM
Expanding a seed set into a larger community is a common procedure in link-based analysis. We show how to adapt recent results from theoretical computer science to expand a seed s...
149
click to vote
LICS
2008
IEEE
16 years 23 days ago
2008
IEEE
We study the classes of B¨uchi and Rabin automatic structures. For B¨uchi (Rabin) automatic structures their domains consist of infinite strings (trees), and the basic relation...
152
click to vote
LICS
2007
IEEE
16 years 20 days ago
2007
IEEE
Developing a theory of bisimulation in higher-order languages can be hard. Particularly challenging can be: (1) the proof of congruence, as well as enhancements of the bisimulatio...
183
click to vote
MFCS
2007
Springer
16 years 15 days ago
2007
Springer
In formal language theory, many families of languages are defined using grammars or finite acceptors like pushdown automata and Turing machines. For instance, context-sensitive l...
154
click to vote
POLICY
2007
Springer
16 years 15 days ago
2007
Springer
The richness of today’s electronic communications mirrors physical world: activities such as shopping, business and scientific collaboration are conducted online. Current intera...