994 search results - page 113 / 199 » Custom Computing Machines for the Set Covering Problem |
95
Voted
IPPS
2010
IEEE
14 years 10 months ago
2010
IEEE
We address the design of algorithms for multicores that are oblivious to machine parameters. We propose HM, a multicore model consisting of a parallel shared-memory machine with hi...
121
Voted
CORR
2008
Springer
15 years 20 days ago
2008
Springer
This paper presents improved approximation algorithms for the problem of multiprocessor scheduling under uncertainty (SUU), in which the execution of each job may fail probabilist...
92
Voted
FOCS
1993
IEEE
15 years 4 months ago
1993
IEEE
This paper investigates the computational complexity of approximating several NPoptimization problems using the number of queries to an NP oracle as a complexity measure. The resu...
71
Voted
STACS
1997
Springer
15 years 4 months ago
1997
Springer
In this paper we present a new notion of what it means for a problem in P to be inherently sequential. Informally, a problem L is strictly sequential P-complete if when the best kn...
121
click to vote
ICPR
2008
IEEE
16 years 1 months ago
2008
IEEE
Impression evidence in the form of shoe-prints are commonly found in crime scenes. A critical step in automatic shoe-print identification is extraction of the shoe-print pattern. ...