| 2003 |
|---|
| 10 | | Daniel S. Bernstein,
Lev Finkelstein,
Shlomo Zilberstein:
Contract Algorithms and Robots on Rays: Unifying Two Scheduling Problems.
IJCAI 2003: 1211-1217 |
| 9 | EE | Aviad Cohen,
Lev Finkelstein,
Avi Mendelson,
Ronny Ronen,
Dmitry Rudoy:
On Estimating Optimal Performance of CPU Dynamic Thermal Management.
Computer Architecture Letters 2: (2003) |
| 8 | EE | Lev Finkelstein,
Shaul Markovitch,
Ehud Rivlin:
Optimal Schedules for Parallelizing Anytime Algorithms: The Case of Shared Resources.
J. Artif. Intell. Res. (JAIR) 19: 73-138 (2003) |
| 2002 |
|---|
| 7 | | Daniel S. Bernstein,
Theodore J. Perkins,
Shlomo Zilberstein,
Lev Finkelstein:
Scheduling Contract Algorithms on Multiple Processors.
AAAI/IAAI 2002: 702-706 |
| 6 | | Lev Finkelstein,
Shaul Markovitch,
Ehud Rivlin:
Optimal Schedules for Parallelizing Anytime Algorithms: The Case of Independent Processes.
AAAI/IAAI 2002: 719-724 |
| 5 | EE | Lev Finkelstein,
Evgeniy Gabrilovich,
Yossi Matias,
Ehud Rivlin,
Zach Solan,
Gadi Wolfman,
Eytan Ruppin:
Placing search in context: the concept revisited.
ACM Trans. Inf. Syst. 20(1): 116-131 (2002) |
| 2001 |
|---|
| 4 | EE | Lev Finkelstein,
Evgeniy Gabrilovich,
Yossi Matias,
Ehud Rivlin,
Zach Solan,
Gadi Wolfman,
Eytan Ruppin:
Placing search in context: the concept revisited.
WWW 2001: 406-414 |
| 3 | EE | Lev Finkelstein,
Shaul Markovitch:
Optimal schedules for monitoring anytime algorithms.
Artif. Intell. 126(1-2): 63-108 (2001) |
| 1998 |
|---|
| 2 | EE | Lev Finkelstein,
Shaul Markovitch:
A Selective Macro-learning Algorithm and its Application to the NxN Sliding-Tile Puzzle
CoRR cs.AI/9806102: (1998) |
| 1 | EE | Lev Finkelstein,
Shaul Markovitch:
A Selective Macro-learning Algorithm and its Application to the NxN Sliding-Tile Puzzle.
J. Artif. Intell. Res. (JAIR) 8: 223-263 (1998) |
