2061 search results - page 115 / 413 » The continuous knapsack set |
136
click to vote
ICPP
2008
IEEE
15 years 10 months ago
2008
IEEE
An asynchronous work-stealing implementation of dynamic load balance is implemented using Unified Parallel C (UPC) and evaluated using the Unbalanced Tree Search (UTS) benchmark ...
172
click to vote
AGENTCL
2003
Springer
15 years 9 months ago
2003
Springer
We propose group communication for agent coordination within “active rooms” and other pervasive computing scenarios featuring strict real-time requirements, inherently unrelia...
124
click to vote
IJCGA
2008
15 years 4 months ago
2008
Given a set P of points (clients) in the plane, a Euclidean 2-centre of P is a set of two points (facilities) in the plane such that the maximum distance from any client to its ne...
194
click to vote
ICASSP
2011
IEEE
14 years 7 months ago
2011
IEEE
—The low-rank matrix completion problem can be stated as follows: given a subset of the entries of a matrix, find a low-rank matrix consistent with the observations. There exist...
132
click to vote
OSDI
2004
ACM
16 years 4 months ago
2004
ACM
We present a new technique, failure-oblivious computing, that enables servers to execute through memory errors without memory corruption. Our safe compiler for C inserts checks th...