971 search results - page 10 / 195 » Approximate Satisfiability and Equivalence |
SODA
2003
ACM
13 years 11 months ago
2003
ACM
Motivated by several applications, we introduce various distance measures between “top k lists.” Some of these distance measures are metrics, while others are not. For each of...
FMCAD
2007
Springer
14 years 1 months ago
2007
Springer
In today's SoC design cycles, debugging is one of the most time consuming manual tasks. CAD solutions strive to reduce the inefficiency of debugging by identifying error sourc...
RTSS
2002
IEEE
14 years 2 months ago
2002
IEEE
Typical real-time scheduling theory has addressed deadline and energy constraints as well as deadline and reward constraints simultaneously in the past. However, we believe that e...
ENTCS
2011
13 years 1 months ago
2011
We revisit the connection between three notions of computation: Moggi’s monads, Hughes’s arrows and McBride and Paterson’s idioms (also called applicative functors). We show...
COMBINATORICS
2006
13 years 9 months ago
2006
Let Sn be the group of permutations of [n] = {1, . . . , n}. The Bruhat order on Sn is a partial order relation, for which there are several equivalent definitions. Three well-kno...