35 citations · 41 across the 5 of their papers we have counts for
Showing cs.AIShow all
3 papers · 1 filter
cs.AI2011★ 35 cited
Learning to Order BDD Variables in Verification
O. Grumberg, S. Livne, S. Markovitch
The size and complexity of software and hardware systems have significantly increased in the past years. As a result, it is harder to guarantee their correct behavior. One of the m…
cs.AI2011★ 5 cited
Optimal Schedules for Parallelizing Anytime Algorithms: The Case of Shared Resources
L. Finkelstein, S. Markovitch, E. Rivlin
The performance of anytime algorithms can be improved by simultaneously solving several instances of algorithm-problem pairs. These pairs may include different instances of a probl…
cs.AI2011★ 1 cited
The Divide-and-Conquer Subgoal-Ordering Algorithm for Speeding up Logic Inference
O. Ledeniov, S. Markovitch
It is common to view programs as a combination of logic and control: the logic part defines what the program must do, the control part -- how to do it. The Logic Programming paradi…