Browse Papers
From IFORS
Contact Us
English
Remember me
Login
Forgot password?
Shmuel Gal
Information about the author Shmuel Gal will soon be added to the site.
Found
11 papers
in total
Date Descending
Date Ascending
Title Descending
Title Ascending
Analysis and design of selection committees: a game theoretic secretary problem
2009
Firms often delegate important decisions to committees which are set up specifically...
Network search games, with arbitrary searcher starting point
2008
We analyze a zero-sum game between a blind unit-speed searcher and a stationary hider...
Searching symmetric networks with Utilitarian-Postman paths
2009
We introduce the notion of a Utilitarian Postman (UP) path on a network Q as one which...
Searching for an agent who may or may not want to be found
2002
There is an extensive theory regarding optimal continuous path search for a mobile or...
Rendezvous search when marks are left at the starting points
2001
Leaving marks at the starting points in a rendezvous search problem may provide the...
Rendezvous search on the line
1999
We present two new results for the asymmetric rendezvous problem on the line. We first...
Rendezvous on the line when the players' initial distance is given by an unknown probability distribution
1998
Two players A and B are randomly placed on a line. The distribution of the distance...
Mathematical analysis of statistical sampling for estimating computer cache performance
1996
Computer cache memory simulations consume a lot of resources, both in terms of disk...
Optimal partitioning which maximizes the sum of the weighted averages
1995
We consider an optimal partitioning problem that occurs in the assignment of computer...
Mathematical analysis of statistical sampling for estimating computer cache performance
1996
Computer cache memory simulations consume a lot of resources, both in terms of disk...
The Parameter Iteration Method in dynamic programming
1989
Many practical problems involve making optimal decisions for systems with state...
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers