13306 search results - page 389 / 2662 » Theoretical Computer Science |
157
Voted
GI
2009
Springer
15 years 4 months ago
2009
Springer
: Both, games in a game theoretic sense and protocols in an informational sense describe rule based interactions between systems. Some similarities and differences of both approach...
179
click to vote
CSR
2009
Springer
16 years 1 months ago
2009
Springer
A homomorphism from a graph G to a graph H (in this paper, both simple, undirected graphs) is a mapping f : V (G) → V (H) such that if uv ∈ E(G) then f(u)f(v) ∈ E(H). The pro...
124
click to vote
FOCS
2006
IEEE
16 years 27 days ago
2006
IEEE
We prove that the function d : R3 × R3 → [0, ∞) given by d (x, y, z), (t, u, v) = (t − x)2 + (u − y)2 2 + (v − z + 2xu − 2yt)2 1 2 + (t − x)2 + (u − y)2 1 2 . is ...
160
Voted
GI
2005
Springer
16 years 10 days ago
2005
Springer
: The concept of symbolic or semantic locations significantly simplifies the development of several applications that access location information in mobile scenarios. This paper mo...
167
click to vote
ACSC
2002
IEEE
15 years 11 months ago
2002
IEEE
This paper presents a formal notation for specifying requirements of embedded systems which exhibit continuous, real-time behaviour and move through various modes under digital co...