2168 search results - page 255 / 434 » Using Approximation Hardness to Achieve Dependable Computati... |
206
click to vote
TSP
2012
14 years 1 days ago
2012
Abstract—In this paper, we investigate the problem of designing compact-support interpolation kernels for a given class of signals. By using calculus of variations, we simplify t...
171
click to vote
PVM
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. Designing and tuning parallel applications with MPI, particularly at large scale, requires understanding the performance implications of different choices of algorithms ...
136
click to vote
SIGECOM
2009
ACM
15 years 11 months ago
2009
ACM
Voting trees describe an iterative procedure for selecting a single vertex from a tournament. vide a very general abstract model of decision-making among a group of individuals, a...
139
click to vote
STOC
2009
ACM
16 years 5 months ago
2009
ACM
We consider the problem of MaxMin allocation of indivisible goods. There are m items to be distributed among n players. Each player i has a nonnegative valuation pij for an item j...
140
click to vote
IPSN
2009
Springer
15 years 11 months ago
2009
Springer
We consider the problem of monitoring spatial phenomena, such as road speeds on a highway, using wireless sensors with limited battery life. A central question is to decide where ...