4894 search results - page 159 / 979 » Choices |
167
click to vote
SIGMETRICS
2004
ACM
16 years 13 days ago
2004
ACM
Binary search tree (BST) based data structures, such as AVL trees, red-black trees, and splay trees, are often used in system software, such as operating system kernels. Choosing ...
158
click to vote
ECAI
2004
Springer
16 years 12 days ago
2004
Springer
Finite-domain constraint programming can be used to solve a wide range of problems by first modelling the problem as a set of constraints that characterise the problem’s solutio...
176
click to vote
ECOOP
2004
Springer
16 years 12 days ago
2004
Springer
After two decades of effort, type inference for dynamically typed languages scales to programs of a few tens of thousands of lines of code, but no further. For larger programs, th...
201
Voted
FSTTCS
2004
Springer
16 years 11 days ago
2004
Springer
Abstract Abstract. In this paper we improve the analysis of approximation algorithms based on semidefinite programming for the maximum graph partitioning problems MAX-k-CUT, MAX-k...
170
click to vote
JELIA
2004
Springer
16 years 11 days ago
2004
Springer
Abstract. Results in social choice theory such as the Arrow and GibbardSatterthwaite theorems constrain the existence of rational collective decision making procedures in groups of...