3179 search results - page 405 / 636 » Applications of PCF Theory |
EUROPAR
2003
Springer
14 years 2 months ago
2003
Springer
In this presentation, we give an overview of research activities at the Department of Computing Science, Ume˚a University with focus on Scientific, Parallel and High-Performance...
SIGECOM
2010
ACM
14 years 2 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...
SIGMOD
2010
ACM
14 years 2 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...
MMB
2010
Springer
14 years 2 months ago
2010
Springer
Abstract. Computing tight performance bounds in feed-forward networks under general assumptions about arrival and server models has turned out to be a challenging problem. Recently...
GEOS
2009
Springer
14 years 1 months ago
2009
Springer
Abstract. The realization of Semantic Web reasoning is central to substantiating the Semantic Web vision. However, current mainstream research on this topic faces serious challenge...