Learn More
Reasoning about time is important in real-life situations and in engineered systems. In this research, we develop new algorithms for solving the Simple Temporal Problems (STP) and the more general Temporal Constraint Satisfaction Problem (TCSP). First, we propose a new efficient algorithm, the STP-solver, for computing the minimal network of an STP. This(More)
In this prospective phase II clinical trial, multiple myeloma (MM) patients were randomized to receive a second (tandem) autologous stem cell transplantation (ASCT) based on whether they achieved a partial response or worse (≤PR) following initial ASCT (ASCT1). Patients who achieved a very good partial response or better (≥VGPR) had salvage ASCT at relapse.(More)
  • 1