3663 search results - page 206 / 733 » Problems in the ontology of computer programs |
181
click to vote
COLT
1999
Springer
15 years 11 months ago
1999
Springer
We present a unified framework for reasoning about worst-case regret bounds for learning algorithms. This framework is based on the theory of duality of convex functions. It brin...
187
click to vote
CPAIOR
2008
Springer
15 years 8 months ago
2008
Springer
Theoretical models for the evaluation of quickly improving search strategies, like limited discrepancy search, are based on specific assumptions regarding the probability that a va...
156
click to vote
IPPS
2007
IEEE
16 years 26 days ago
2007
IEEE
Due to fundamental physical limitations and power constraints, we are witnessing a radical change in commodity microprocessor architectures to multicore designs. Continued perform...
268
click to vote
ICALP
2009
Springer
16 years 6 months ago
2009
Springer
Correlation Clustering was defined by Bansal, Blum, and Chawla as the problem of clustering a set of elements based on a possibly inconsistent binary similarity function between e...
196
click to vote
CDC
2008
IEEE
16 years 1 months ago
2008
IEEE
— The assignment problem constitutes one of the fundamental problems in the context of linear programming. Besides its theoretical significance, its frequent appearance in the a...