233 search results - page 37 / 47 » Computationally feasible VCG mechanisms |
PCM
2005
Springer
14 years 2 months ago
2005
Springer
In general, motion compensated (MC) deinterlacing algorithms can outperform non-MC (NMC) ones. However, we often prefer to choose the latter due to the considerations of error prop...
MIDDLEWARE
2004
Springer
14 years 1 months ago
2004
Springer
The increasing popularity of XML Web services motivates us to examine if it is feasible to substitute one vendor service for another when using a Web-based application, assuming th...
Publication
The need for service providers to offer SLAs to gain consumers confidence has become increasingly apparent. Our work focuses on providers who manage the execution of long-running d...
JCST
2008
13 years 8 months ago
2008
Research into ant colony algorithms for solving continuous optimization problems forms one of the most significant and promising areas in swarm computation. Although traditional an...
INFOCOM
2010
IEEE
13 years 6 months ago
2010
IEEE
Abstract--Achieving fast, precise, and scalable fault localization has long been a highly desired feature in all-optical mesh networks. Monitoring tree (m-tree) is an interesting m...