844 search results - page 158 / 169 » Solving the p |
COMPGEOM
2010
ACM
15 years 2 months ago
2010
ACM
Let D be a weighted directed graph cellularly embedded in a surface of genus g, orientable or not, possibly with boundary. We describe algorithms to compute a shortest non-contrac...
STOC
2010
ACM
15 years 2 months ago
2010
ACM
We propose a new framework for discussing computational complexity of problems involving uncountably many objects, such as real numbers, sets and functions, that can be represente...
EDCC
2010
Springer
15 years 2 months ago
2010
Springer
: While lots of consensus algorithms have been proposed for crash-prone asynchronous message-passing systems enriched with a failure detector of the class Ω (the class of eventua...
110
click to vote
FUN
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. We analyze the computational complexity of various twodimensional platform games. We identify common properties of these games that allow us to state several meta-theorem...
103
click to vote
AGENTS
2001
Springer
15 years 2 months ago
2001
Springer
Matchmaking is the process of mediating demand and supply based on profile information. Matchmaking plays a crucial role in agent-based electronic marketplaces: the problem to be ...