674 search results - page 11 / 135 » The computational complexity of the parallel knock-out probl... |
ICDCS
2011
IEEE
12 years 7 months ago
2011
IEEE
— In the emerging cloud computing paradigm, data owners become increasingly motivated to outsource their complex data management systems from local sites to the commercial public...
SPAA
2003
ACM
14 years 19 days ago
2003
ACM
The general problem of verifying coherence for shared-memory multiprocessor executions is NP-Complete. Verifying memory consistency models is therefore NP-Hard, because memory con...
PPSN
1994
Springer
13 years 11 months ago
1994
Springer
The Reproductive Plan Language 2 (RPL2) is an extensible interpreted language for writing and using evolutionary computing programs. It supports arbitrary genetic representations,...
COMPGEOM
2004
ACM
14 years 25 days ago
2004
ACM
We consider the exact and approximate computational complexity of the multivariate LMS linear regression estimator. The LMS estimator is among the most widely used robust linear s...
WINE
2009
Springer
14 years 2 months ago
2009
Springer
We study an economic setting in which a principal motivates a team of strategic agents to exert costly effort toward the success of a joint project. The action taken by each agent...