#### Filter Results:

#### Publication Year

2006

2015

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

- Farzaneh Mirzazadeh, Babak Behsaz, Hamid Beigy
- 2006

One of the most effective methods in hierarchical reinforcement learning is MAXQ method introduced in [1]. Although this method is shown to be effective in many applications, it is computationally expensive in applications with deep hierarchy [2], which makes it impractical for use in such applications. In this paper, we propose a new learning algorithm for… (More)

In recent years, Global and Grid Computing emerge as two powerful technology trends. In this paper, we compare these two approaches of distributed computing. First, we present a definition for Global Computing that accentuates the key point in this trend. This key point distinguishes Global Computing from other trends and covers many such systems. Second,… (More)

In this paper, we consider the Unsplittable (hard) Capacitated Facility Location Problem (UCFLP) with uniform capacities and present new approximation algorithms for it. This problem is a generalization of the classical facility location problem where each facility can serve at most u units of demand and each client must be served by exactly one facility.… (More)

Given a metric $$(V,d)$$ ( V , d ) and an integer $$k$$ k , we consider the problem of partitioning the points of $$V$$ V into at most $$k$$ k clusters so as to minimize the sum of radii or the sum of diameters of these clusters. The former problem is called the minimum sum of radii (MSR) problem and the latter is the minimum sum of diameters (MSD) problem.… (More)

Determining the size of minimum vertex cover of a graph G, denoted by β(G), is an NP-complete problem. Also, for only few families of graphs, β(G) is known. We study the size of minimum vertex cover in generalized Petersen graphs. For each n and k (n > 2k), a generalized Petersen graph P n and subscripts are reduced modulo n. First, we characterize minimum… (More)

We consider two closely related fundamental clustering problems in this paper. In the min-sum k-clustering one is given a metric space and has to partition the points into k clusters while minimizing the sum of pairwise distances between the points within the clusters. In the Balanced k-Median problem the instance is the same and one has to obtain a… (More)

We consider a facility-location problem that abstracts settings where the cost of serving the clients assigned to a facility is incurred by the facility. Formally, we consider the minimum-load k-facility location (MLkFL) problem, which is defined as follows. We have a set F of facilities, a set C of clients, and an integer k ≥ 0. Assigning client j to a… (More)

- Sara Ahmadian, Babak Behsaz, Zachary Friggstad, Amin Jorati, Mohammad R Salavatipour, Chaitanya Swamy
- 2014

We consider a facility-location problem that abstracts settings where the cost of serving the clients assigned to a facility is incurred by the facility. Formally, we consider the minimum-load k-facility location (MLkFL) problem, which is defined as follows. We have a set F of facilities, a set C of clients, and an integer k ≥ 0. Assigning client j to a… (More)

- Sara Ahmadian, Babak Behsaz, Zachary Friggstad, Amin Jorati, Mohammad R Salavatipour, Chaitanya Swamy +4 others
- 2014

We consider a facility-location problem that abstracts settings where the cost of serving the clients assigned to a facility is incurred by the facility. Formally, we consider the minimum-load k-facility location (MLkFL) problem, which is defined as follows. We have a set F of facilities, a set C of clients, and an integer k ≥ 0. Assigning client j to a… (More)