In this paper, we address one critical limitation of the previous work on the problem of memory exploration in high-level synthesis, namely, a tight coupling of scheduling effects with memory exploration, that has been ignored by most existing memory synthesis systems. To overcome the limitation, we propose an integrated approach that takes into account the memory configurations and schedules simultaneously. Experimental data on a set of benchmark filter designs are provided to show the effectiveness of the proposed exploration strategy in finding close-to-optimal memory configurations.