470 search results - page 82 / 94 » From evidence-based policy making to policy analytics |
200
Voted
POPL
2004
ACM
16 years 21 days ago
2004
ACM
We present a polynomial time randomized algorithm for global value numbering. Our algorithm is complete when conditionals are treated as non-deterministic and all operators are tr...
110
click to vote
SOFSEM
2010
Springer
15 years 9 months ago
2010
Springer
Regret minimization has proven to be a very powerful tool in both computational learning theory and online algorithms. Regret minimization algorithms can guarantee, for a single de...
100
Voted
SACMAT
2009
ACM
15 years 7 months ago
2009
ACM
A number of research systems have demonstrated the benefits of accompanying each request with a machine-checkable proof that the request complies with access-control policy — a...
INFOCOM
2007
IEEE
15 years 6 months ago
2007
IEEE
Abstract—We present a distributed routing algorithm for finding two disjoint (primary and backup) QoS paths that run across multiple domains. Our work is inspired by the recent ...
107
Voted
SIGIR
2006
ACM
15 years 6 months ago
2006
ACM
In today’s data-rich networked world, people express many aspects of their lives online. It is common to segregate different aspects in different places: you might write opinion...