Sciweavers

2027 search results - page 10 / 406
» When is it best to best-respond
Sort
View
PC
2002
82views Management» more  PC 2002»
13 years 9 months ago
Time-minimal tiling when rise is larger than zero
This paper presents a solution to the open problem of finding the optimal tile size to minimise the execution time of a parallelogram-shaped iteration space on a distributed memory...
Jingling Xue, Wentong Cai
ISVC
2009
Springer
14 years 4 months ago
Biometric Recognition: When Is Evidence Fusion Advantageous?
Abstract. Having assessed the performance gains due to evidence fusion, previous works reported contradictory conclusions. For some, a consistent improvement is achieved, while oth...
Hugo Proença
ICSE
2008
IEEE-ACM
14 years 10 months ago
Best practices in extreme programming course design
Teaching (and therefore learning) eXtreme Programming (XP) in a university setting is difficult because of course time limitations and the soft nature of XP that requires first-ha...
Kai Stapel, Daniel Lübke, Eric Knauss
HICSS
2007
IEEE
141views Biometrics» more  HICSS 2007»
14 years 4 months ago
Second-Best Combinatorial Auctions - The Case of the Pricing-Per-Column Mechanism
One of the main contributions of classical mechanism design is the derivation of the Groves mechanisms. The class of Groves mechanisms are the only mechanisms that are strategy-pr...
Dirk Neumann, Björn Schnizler, Ilka Weber, Ch...
ICA
2007
Springer
14 years 4 months ago
Blind Instantaneous Noisy Mixture Separation with Best Interference-Plus-Noise Rejection
Abstract. In this paper, a variant of the well known algorithm FastICA is proposed to be used for blind source separation in off-line (block processing) setup and a noisy environm...
Zbynek Koldovský, Petr Tichavský