5802 search results - page 372 / 1161 » Parallelizing Feature Selection |
141
click to vote
PPSC
1993
15 years 5 months ago
1993
The dense nonsymmetric eigenproblem is one of the hardest linear algebra problems to solvee ectively on massivelyparallel machines. Rather than trying to design a black box" ...
126
click to vote
IPPS
2007
IEEE
15 years 10 months ago
2007
IEEE
Replicating data objects onto servers across a system can alleviate access delays. The selection of data objects and servers requires solving a constraint optimization problem, wh...
150
click to vote
SPAA
2005
ACM
15 years 10 months ago
2005
ACM
We describe a new class of utility-maximization scheduling problem with precedence constraints, the disconnected staged scheduling problem (DSSP). DSSP is a nonpreemptive multipro...
166
click to vote
ICDCS
2007
IEEE
15 years 8 months ago
2007
IEEE
As a key approach to achieve energy efficiency in sensor networks, sensing coverage has been studied extensively. Researchers have designed many coverage protocols to provide vario...
151
click to vote
OOPSLA
2001
Springer
15 years 9 months ago
2001
Springer
Regression testing is applied to modified software to provide confidence that the changed parts behave as intended and that the unchanged parts have not been adversely affected ...