2470 search results - page 120 / 494 » Liveness-Preserving Simulation Relations |
114
Voted
CMOT
2004
15 years 16 days ago
2004
We describe a methodology to examine bipartite relational data structures as exemplified in networks of corporate interlocking. These structures can be represented as bipartite gr...
99
Voted
RT
1999
Springer
15 years 5 months ago
1999
Springer
Abstract. An algorithm for simulating diffuse interreflection in complex three dimensional scenes is described. It combines techniques from hierarchical radiosity and multiresolut...
115
click to vote
ACMSE
2007
ACM
15 years 4 months ago
2007
ACM
A major paradigm of modeling the decision making of autonomous agents is through behavior-based network models. The network consists of distributed behaviors that compete (or coop...
APPROX
2007
Springer
15 years 4 months ago
2007
Springer
We prove a lower bound for swapping the order of Arthur and Merlin in two-round MerlinArthur games using black-box techniques. Namely, we show that any AM-game requires time (t2 )...
127
click to vote
RTA
1995
Springer
15 years 4 months ago
1995
Springer
We present a completion procedure (called MKB) that works for multiple reduction orderings. Given equations and a set of reduction orderings, the procedure simulates a computation ...