696 search results - page 85 / 140 » A class of combinatorial identities |
156
click to vote
FCA
2005
Springer
15 years 11 months ago
2005
Springer
Formal Concept Analysis (FCA) has typically been applied in the field of software engineering to support software maintenance and object-oriented class identification tasks. This...
125
click to vote
MFCS
2005
Springer
15 years 11 months ago
2005
Springer
We prove that every disjoint NP-pair is polynomial-time, many-one equivalent to the canonical disjoint NP-pair of some propositional proof system. Therefore, the degree structure ...
176
click to vote
STACS
2004
Springer
15 years 11 months ago
2004
Springer
We study a class of single-round, sealed-bid auctions for a set of identical items. We adopt the worst case competitive framework defined by [1,2] that compares the profit of an ...
177
click to vote
FOSSACS
2001
Springer
15 years 10 months ago
2001
Springer
The rewriting calculus, or Rho Calculus (ρCal), is a simple calculus that uniformly integrates abstraction on patterns and nondeterminism. Therefore, it fully integrates rewriting...
134
click to vote
ATAL
2006
Springer
15 years 10 months ago
2006
Springer
We present a technique for reducing a normal-form (aka. (bi)matrix) game, O, to a smaller normal-form game, R, for the purpose of computing a Nash equilibrium. This is done by com...