5344 search results - page 145 / 1069 » Privacy-Preserving Set Operations |
135
click to vote
CPAIOR
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. We propose a new solution approach for the Job Shop Problem with Sequence Dependent Setup Times (SDST-JSP). The problem consists in scheduling jobs, each job being a set ...
119
click to vote
IPPS
1998
IEEE
15 years 7 months ago
1998
IEEE
An effort to formalize the process of software pipelining loops with conditions is presented in this paper. A formal framework for scheduling such loops, based on representing set...
126
click to vote
ALP
1994
Springer
15 years 7 months ago
1994
Springer
Abstract. We introduce a compositional characterization of the operational semantics of equational Horn programs. Then we show that this semantics and the standard operational sema...
104
click to vote
FSTTCS
2006
Springer
15 years 7 months ago
2006
Springer
We consider a general class of timed automata parameterized by a set of "input-determined" operators, in a continuous time setting. We show that for any such set of opera...
123
click to vote
AUSAI
2007
Springer
15 years 7 months ago
2007
Springer
Planning as satisfiability is a powerful approach to solving domain independent planning problems. In this paper, we consider a relaxed semantics for plans with parallel operator a...