2100 search results - page 344 / 420 » Fundamentals of the problem |
168
click to vote
CCS
2004
ACM
15 years 11 months ago
2004
ACM
Comparing the expressive power of access control models is recognized as a fundamental problem in computer security. Such comparisons are generally based on simulations between di...
195
click to vote
PROMAS
2004
Springer
15 years 11 months ago
2004
Springer
Distributed partially observable Markov decision problems (POMDPs) have emerged as a popular decision-theoretic approach for planning for multiagent teams, where it is imperative f...
162
click to vote
SIGECOM
2010
ACM
15 years 10 months ago
2010
ACM
One of the fundamental problems in the theory of social choice is aggregating the rankings of a set of agents (or voters) into a consensus ranking. Rank aggregation has found appl...
157
click to vote
SIGMOD
2010
ACM
15 years 10 months ago
2010
ACM
Maximal clique enumeration (MCE) is a fundamental problem in graph theory and has important applications in many areas such as social network analysis and bioinformatics. The prob...
171
Voted
POPL
1998
ACM
15 years 9 months ago
1998
ACM
This paper addresses the problem of how to apply pointer analysis to a wide variety of compiler applications. We are not presenting a new pointer analysis. Rather, we focus on put...