10493 search results - page 1330 / 2099 » Dynamic Word Problems |
197
click to vote
CORR
2006
Springer
15 years 7 months ago
2006
Springer
Let G1 be a cyclic multiplicative group of order n. It is known that the Diffie-Hellman problem is random self-reducible in G1 with respect to a fixed generator g if (n) is known....
203
click to vote
EOR
2006
15 years 7 months ago
2006
This paper considers a project scheduling problem with the objective of minimizing resource availability costs, taking into account a deadline for the project and precedence relat...
202
Voted
JAIR
2008
15 years 7 months ago
2008
We represent planning as a set of loosely coupled network flow problems, where each network corresponds to one of the state variables in the planning domain. The network nodes cor...
166
click to vote
JCP
2008
15 years 7 months ago
2008
To build a cooperative logistics network covering multiple enterprises, a planning method that can build a long-distance transportation network is required. Many strict constraints...
191
Voted
ITSSA
2006
15 years 7 months ago
2006
: The problem of patient scheduling in hospitals is characterized by high uncertainty and dynamics in patient treatments. Additional complexity in the planning and coordination pro...