2474 search results - page 186 / 495 » Solving Problems on Parallel Computers by Cellular Programmi... |
203
click to vote
SC
2003
ACM
16 years 5 days ago
2003
ACM
Distributing data is a fundamental problem in implementing efficient distributed-memory parallel programs. The problem becomes more difficult in environments where the participa...
186
click to vote
NETCOOP
2007
Springer
16 years 1 months ago
2007
Springer
In this paper we study a pursuit problem in the context of a wireless sensor network, where the pursuer (i.e., mobile sink) trying to capture a pursuee (i.e., tracked object), movi...
171
click to vote
ICASSP
2010
IEEE
15 years 7 months ago
2010
IEEE
Polytope Faces Pursuit is a greedy algorithm that performs Basis Pursuit with similar order complexity to Orthogonal Matching Pursuit. The algorithm adds one basis vector at a tim...
149
click to vote
DISOPT
2007
15 years 6 months ago
2007
Finding a feasible solution of a given Mixed-Integer Programming (MIP) model is a very important (NP-complete) problem that can be extremely hard in practice. Very recently, Fisch...
180
click to vote
EGH
2005
Springer
16 years 13 days ago
2005
Springer
Complex shaders must be partitioned into multiple passes to execute on GPUs with limited hardware resources. Automatic partitioning gives rise to an NP-hard scheduling problem tha...