The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Nahum Shimkin: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Shie Mannor, Nahum Shimkin
    Adaptive Strategies and Regret Minimization in Arbitrarily Varying Markov Environments. [Citation Graph (0, 0)][DBLP]
    COLT/EuroCOLT, 2001, pp:128-142 [Conf]
  2. Shie Mannor, Nahum Shimkin
    On-Line Learning with Imperfect Monitoring. [Citation Graph (0, 0)][DBLP]
    COLT, 2003, pp:552-566 [Conf]
  3. Shie Mannor, Nahum Shimkin
    Online Learning with Variable Stage Duration. [Citation Graph (0, 0)][DBLP]
    COLT, 2006, pp:408-422 [Conf]
  4. Reuven Zaritsky, Natan Peterfreund, Nahum Shimkin
    Velocity-Guided Tracking of Deformable Contours in Three Dimensional Space. [Citation Graph (0, 0)][DBLP]
    ECCV (1), 2000, pp:251-266 [Conf]
  5. Ishai Menache, Shie Mannor, Nahum Shimkin
    Q-Cut - Dynamic Discovery of Sub-goals in Reinforcement Learning. [Citation Graph (0, 0)][DBLP]
    ECML, 2002, pp:295-306 [Conf]
  6. Gozde B. Unal, Delphine Nain, G. Ben-Arous, Nahum Shimkin, Allen Tannenbaum, Ofer Zeitouni
    Algorithms for stochastic approximations of curvature flows. [Citation Graph (0, 0)][DBLP]
    ICIP (2), 2003, pp:651-654 [Conf]
  7. Eitan Altman, Tamer Basar, Tania Jiménez, Nahum Shimkin
    Competitive Routing in Networks with Polynomial Cost. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2000, pp:1586-1593 [Conf]
  8. Eitan Altman, Ariel Orda, Nahum Shimkin
    Bandwidth Allocation for Guaranteed versus Best Effort Service Categories. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 1998, pp:617-624 [Conf]
  9. Israel Ben-Shahar, Ariel Orda, Nahum Shimkin
    Best-Effort Resource Sharing by Users with QoS Requirements. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 1999, pp:883-890 [Conf]
  10. Ariel Orda, Raphael Rom, Nahum Shimkin
    Competitive Routing in Multi-User Communication Networks. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 1993, pp:964-971 [Conf]
  11. Ariel Orda, Nahum Shimkin
    Incentive Pricing in Multi-Class Communication Networks. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 1997, pp:659-666 [Conf]
  12. Shie Mannor, Nahum Shimkin
    The Steering Approach for Multi-Criteria Reinforcement Learning. [Citation Graph (0, 0)][DBLP]
    NIPS, 2001, pp:1563-1570 [Conf]
  13. Ishai Menache, Nahum Shimkin
    Proportional QoS in Differentiated Services Networks: Capacity Management, Equilibrium Analysis and Elastic Demands. [Citation Graph (0, 0)][DBLP]
    WINE, 2005, pp:728-737 [Conf]
  14. Reuven Zaritsky, Natan Peterfreund, Nahum Shimkin
    Velocity-Guided Tracking of Deformable Contours in Three Dimensional Space. [Citation Graph (0, 0)][DBLP]
    International Journal of Computer Vision, 2003, v:51, n:3, pp:219-238 [Journal]
  15. Shie Mannor, Nahum Shimkin
    A Geometric Approach to Multi-Criterion Reinforcement Learning. [Citation Graph (0, 0)][DBLP]
    Journal of Machine Learning Research, 2004, v:5, n:, pp:325-360 [Journal]
  16. Eitan Altman, Tamer Basar, Tania Jiménez, Nahum Shimkin
    Routing into Two Parallel Links: Game-Theoretic Distributed Algorithms. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 2001, v:61, n:9, pp:1367-1381 [Journal]
  17. Matthew W. Jacobson, Nahum Shimkin, Adam Shwartz
    Markov Decision Processes with Slow Scale Periodic Decisions. [Citation Graph (0, 0)][DBLP]
    Math. Oper. Res., 2003, v:28, n:4, pp:777-800 [Journal]
  18. Shie Mannor, Nahum Shimkin
    The Empirical Bayes Envelope and Regret Minimization in Competitive Markov Decision Processes. [Citation Graph (0, 0)][DBLP]
    Math. Oper. Res., 2003, v:28, n:2, pp:327-345 [Journal]
  19. Israel Ben-Shahar, Ariel Orda, Nahum Shimkin
    Dynamic service sharing with heterogeneous preferences. [Citation Graph (0, 0)][DBLP]
    Queueing Syst., 2000, v:35, n:1-4, pp:83-103 [Journal]
  20. Eitan Altman, Ariel Orda, Nahum Shimkin
    Bandwidth allocation for guaranteed versus best effort service categories. [Citation Graph (0, 0)][DBLP]
    Queueing Syst., 2000, v:36, n:1-3, pp:89-105 [Journal]
  21. Avishai Mandelbaum, Nahum Shimkin
    A model for rational abandonments from invisible queues. [Citation Graph (0, 0)][DBLP]
    Queueing Syst., 2000, v:36, n:1-3, pp:141-173 [Journal]
  22. Nahum Shimkin, Avishai Mandelbaum
    Rational Abandonment from Tele-Queues: Nonlinear Waiting Costs with Heterogeneous Preferences. [Citation Graph (0, 0)][DBLP]
    Queueing Syst., 2004, v:47, n:1-2, pp:117-146 [Journal]
  23. Ariel Orda, Nahum Shimkin
    Incentive pricing in multiclass systems. [Citation Graph (0, 0)][DBLP]
    Telecommunication Systems, 2000, v:13, n:2-4, pp:241-267 [Journal]
  24. Ariel Orda, Raphael Rom, Nahum Shimkin
    Competitive routing in multiuser communication networks. [Citation Graph (0, 0)][DBLP]
    IEEE/ACM Trans. Netw., 1993, v:1, n:5, pp:510-521 [Journal]
  25. Ishai Menache, Nahum Shimkin
    Fixed-Rate Equilibrium in Wireless Collision Channels. [Citation Graph (0, 0)][DBLP]
    NET-COOP, 2007, pp:23-32 [Conf]
  26. Nahum Shimkin
    A Survey of Uniqueness Results for Selfish Routing. [Citation Graph (0, 0)][DBLP]
    NET-COOP, 2007, pp:33-42 [Conf]

  27. Adaptive Aggregation for Reinforcement Learning with Efficient Exploration: Deterministic Domains. [Citation Graph (, )][DBLP]


  28. Decentralized Rate Regulation in Random Access Channels. [Citation Graph (, )][DBLP]


  29. Efficient Rate-Constrained Nash Equilibrium in Collision Channels with State Information. [Citation Graph (, )][DBLP]


  30. Noncooperative power control and transmission scheduling in wireless collision channels. [Citation Graph (, )][DBLP]


  31. Markov Decision Processes with Arbitrary Reward Processes. [Citation Graph (, )][DBLP]


  32. Efficient Reinforcement Learning in Parameterized Models: Discrete Parameter Case. [Citation Graph (, )][DBLP]


Search in 0.074secs, Finished in 0.075secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002