Sciweavers

5898 search results - page 1121 / 1180
» Parallel Computing Environments and Methods
Sort
View
CP
2005
Springer
15 years 8 months ago
Planning and Scheduling to Minimize Tardiness
We combine mixed integer linear programming (MILP) and constraint programming (CP) to minimize tardiness in planning and scheduling. Tasks are allocated to facilities using MILP an...
John N. Hooker
152
Voted
HPCC
2005
Springer
15 years 7 months ago
An Energy-Efficient Uni-scheduling Based on S-MAC in Wireless Sensor Network
S-MAC is a MAC (Medium Access Control) protocol as specialized for the wireless sensor network in order to sacrifice transmission delay and extend the working life of the whole sen...
Tae-Seok Lee, Yuan Yang, Ki-Jeong Shin, Myong-Soon...
143
Voted
OOPSLA
2005
Springer
15 years 7 months ago
Safe futures for Java
is a simple and elegant abstraction that allows concurrency to be expressed often through a relatively small rewrite of a sequential program. In the absence of side-effects, futur...
Adam Welc, Suresh Jagannathan, Antony L. Hosking
155
Voted
SC
2009
ACM
15 years 7 months ago
GPU based sparse grid technique for solving multidimensional options pricing PDEs
It has been shown that the sparse grid combination technique can be a practical tool to solve high dimensional PDEs arising in multidimensional option pricing problems in finance...
Abhijeet Gaikwad, Ioane Muni Toke
BMCBI
2006
157views more  BMCBI 2006»
15 years 2 months ago
Determination of the minimum number of microarray experiments for discovery of gene expression patterns
Background: One type of DNA microarray experiment is discovery of gene expression patterns for a cell line undergoing a biological process over a series of time points. Two import...
Fang-Xiang Wu, W. J. Zhang, Anthony J. Kusalik
« Prev « First page 1121 / 1180 Last » Next »