Sciweavers

2652 search results - page 342 / 531
» Privacy-preserving linear programming
Sort
View
114
Voted
CORR
2006
Springer
91views Education» more  CORR 2006»
15 years 3 months ago
The Complexity of Mean Flow Time Scheduling Problems with Release Times
We study the problem of preemptive scheduling n jobs with given release times on m identical parallel machines. The objective is to minimize the average flow time. We show that wh...
Philippe Baptiste, Peter Brucker, Marek Chrobak, C...
DSS
2006
95views more  DSS 2006»
15 years 3 months ago
On the computability of agent-based workflows
Workflow research is commonly concerned with optimization, modeling, and dependency. In this research, we however address a more fundamental issue. By modeling humans and machines...
Wai Yin Mok, Prashant Palvia, David Paper
ENTCS
2006
273views more  ENTCS 2006»
15 years 3 months ago
Operator Algebras and the Operational Semantics of Probabilistic Languages
We investigate the construction of linear operators representing the semantics of probabilistic programming languages expressed via probabilistic transition systems. Finite transi...
Alessandra Di Pierro, Herbert Wiklicky
ET
2006
55views more  ET 2006»
15 years 3 months ago
Test Planning and Test Resource Optimization for Droplet-Based Microfluidic Systems
Recent years have seen the emergence of dropletbased microfluidic systems for safety-critical biomedical applications. In order to ensure reliability, microsystems incorporating m...
Fei Su, Sule Ozev, Krishnendu Chakrabarty
IJSNET
2008
125views more  IJSNET 2008»
15 years 3 months ago
Minimum-cost sensor arrangement for achieving wanted coverage lifetime
: Suppose we need to watch a set of targets continuously for a required period of time, and suppose we choose any number of sensors from a fixed set of sensor types and place them ...
Jie Wang, Ning Zhong