98 search results - page 17 / 20 » On the hardness of pricing loss-leaders |
AMEC
2003
Springer
15 years 2 months ago
2003
Springer
Auctions define games of incomplete information for which it is often too hard to compute the exact Bayesian-Nash equilibrium. Instead, the infinite strategy space is often popu...
82
Voted
DATE
1999
IEEE
15 years 1 months ago
1999
IEEE
In this paper, we present a system synthesis algorithm, called MOCSYN, which partitions and schedules embedded system specifications to intellectual property cores in an integrate...
165
click to vote
ASPLOS
2009
ACM
15 years 10 months ago
2009
ACM
Future processors are expected to observe increasing rates of hardware faults. Using Dual-Modular Redundancy (DMR), two cores of a multicore can be loosely coupled to redundantly ...
166
click to vote
POPL
2004
ACM
15 years 9 months ago
2004
ACM
We present a polynomial time randomized algorithm for global value numbering. Our algorithm is complete when conditionals are treated as non-deterministic and all operators are tr...
CADE
2001
Springer
15 years 9 months ago
2001
Springer
Proof assistants based on type theories, such as Coq and Lego, allow users to omit subterms on input that can be inferred automatically. While those mechanisms are well known, ad-h...