37217 search results - page 7067 / 7444 » and 2010 |
201
click to vote
CORR
2010
Springer
15 years 7 months ago
2010
Springer
The stable marriage (SM) problem has a wide variety of practical applications, ranging from matching resident doctors to hospitals, to matching students to schools, or more genera...
160
click to vote
CORR
2010
Springer
15 years 7 months ago
2010
Springer
We consider the problem of maximizing a nonnegative (possibly non-monotone) submodular set function with or without constraints. Feige et al. [9] showed a 2/5-approximation for th...
205
click to vote
CORR
2010
Springer
15 years 7 months ago
2010
Springer
Concurrent reachability games is a class of games heavily studied by the computer science community, in particular by the formal methods community. Two standard algorithms for app...
199
click to vote
CORR
2010
Springer
15 years 7 months ago
2010
Springer
The usefulness of parameterized algorithmics has often depended on what Niedermeier has called, "the art of problem parameterization." In this paper we introduce and expl...
184
click to vote
CORR
2010
Springer
15 years 7 months ago
2010
Springer
In our previous work (`An Algebraic Watchdog for Wireless Network Coding'), we proposed a new scheme in which nodes can detect malicious behaviors probabilistically, police th...