2316 search results - page 447 / 464 » The many forms of hypercomputation |
147
click to vote
SIAMCO
2008
15 years 3 months ago
2008
The moment problem matured from its various special forms in the late 19th and early 20th Centuries to a general class of problems that continues to exert profound influence on the...
140
click to vote
PR
2006
15 years 3 months ago
2006
The performance of many supervised and unsupervised learning algorithms is very sensitive to the choice of an appropriate distance metric. Previous work in metric learning and ada...
136
click to vote
SIGARCH
2008
15 years 3 months ago
2008
While technology trends have ushered in the age of chip multiprocessors (CMP) and enabled designers to place an increasing number of cores on chip, a fundamental question is what ...
146
click to vote
SIGECOM
2008
ACM
15 years 3 months ago
2008
ACM
For the problem of allocating one or more items among a group of competing agents, the Vickrey-Clarke-Groves (VCG) mechanism is strategy-proof and efficient. However, the VCG mech...
137
click to vote
SIGECOM
2008
ACM
15 years 3 months ago
2008
ACM
We provide tight information-theoretic lower bounds for the welfare maximization problem in combinatorial auctions. In this problem, the goal is to partition m items among k bidde...