518 search results - page 59 / 104 » Automating Proofs in Category Theory |
SIGECOM
2006
ACM
15 years 5 months ago
2006
ACM
Braess’s Paradox is the counterintuitive but well-known fact that removing edges from a network with “selfish routing” can decrease the latency incurred by traffic in an eq...
SODA
2004
ACM
15 years 1 months ago
2004
ACM
Graph H is a root of graph G if there exists a positive integer k such that x and y are adjacent in G if and only if their distance in H is at most k. Motwani and Sudan [1994] prov...
107
click to vote
JACM
2010
14 years 10 months ago
2010
A temporal constraint language is a set of relations that has a first-order definition in (Q, <), the dense linear order of the rational numbers. We present a complete comple...
PPDP
2010
Springer
14 years 10 months ago
2010
Springer
Control operators for delimited continuations are useful in various fields such as partial evaluation, CPS translation, and representation of monadic effects. While many works in...
ACMSE
2010
ACM
14 years 10 months ago
2010
ACM
Developing software from models is a growing practice and there exist many model-based tools (e.g., model editors, model interpreters) for supporting model-driven engineering. Eve...