9 search results - page 1 / 2 » Optimizing Dynamically-Dispatched Calls with Run-Time Type F... |
99
Voted
PLDI
1994
ACM
15 years 2 months ago
1994
ACM
: Object-oriented programs are difficult to optimize because they execute many dynamically-dispatched calls. These calls cannot easily be eliminated because the compiler does not k...
76
Voted
JMLR
2006
14 years 10 months ago
2006
We discuss the problem of learning to rank labels from a real valued feedback associated with each label. We cast the feedback as a preferences graph where the nodes of the graph ...
149
Voted
CP
2011
Springer
13 years 10 months ago
2011
Springer
A Distributed Constraint Optimization Problem (DCOP) is a fundamental problem that can formalize various applications related to multi-agent cooperation. Since it is NP-hard, consi...
WDAG
2010
Springer
14 years 8 months ago
2010
Springer
Abstract. We give randomized agreement algorithms with constant expected running time in asynchronous systems subject to process failures, where up to a minority of processes may f...
100
click to vote
MSV
2004
14 years 11 months ago
2004
The paper studies the problem of maintaining external dynamic dictionaries with variable length keys. We introduce a new type of balanced trees, called S(b)-trees, which generaliz...