#### Filter Results:

- Full text PDF available (28)

#### Publication Year

1994

2017

- This year (2)
- Last 5 years (27)
- Last 10 years (53)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Deshi Ye, Guochuan Zhang
- SIROCCO
- 1994

Abstract. Online scheduling of parallel jobs is a problem where jobs with unit processing time and integer release times and deadlines are scheduled on a set of processors. Every job requests certain number of processors. In our setting processors are organized as a hypercube and jobs are scheduled on subhypercubes of the hypercube. The objective is to… (More)

- Deshi Ye, Xin Han, Guochuan Zhang
- COCOA
- 2009

- Wun-Tat Chan, Francis Y. L. Chin, Deshi Ye, Yong Zhang, Hong Zhu
- ISAAC
- 2006

We study the online frequency allocation problem for wireless linear (highway) cellular networks, where the geographical coverage area is divided into cells aligned in a line. Calls arrive over time and are served by assigning frequencies to them, and no two calls emanating from the same cell or neighboring cells are assigned the same frequency. The… (More)

- Xin Han, Chao Peng, Deshi Ye, Dahai Zhang, Yan Lan
- Inf. Process. Lett.
- 2010

- Wun-Tat Chan, Francis Y. L. Chin, Deshi Ye, Guochuan Zhang, Yong Zhang
- J. Discrete Algorithms
- 2008

We study the problem of on-line scheduling of parallel jobs on two machines. The jobs are parallel in the sense that each of them specifies the number of processors, in this case 1 or 2, required for simultaneous processing. The jobs are presented one by one. Upon receiving a job, we must assign the job to a time slot in the schedule before the next job is… (More)

- Deshi Ye, Jianhai Chen
- Future Generation Comp. Syst.
- 2013

- Wun-Tat Chan, Yong Zhang, Stanley P. Y. Fung, Deshi Ye, Hong Zhu
- ISAAC
- 2005

We study the problem of finding a longest common increasing subsequence (LCIS) of multiple sequences of numbers. The LCIS problem is a fundamental issue in various application areas, including the whole genome alignment. In this paper we give an efficient algorithm to find the LCIS of two sequences in O(min(r log `, n`+r) log log n+Sort(n)) time where n is… (More)

- Deshi Ye, Guochuan Zhang
- J. Scheduling
- 2007

We study an on-line parallel job scheduling problem, where jobs arrive one by one. A parallel job may require a number of machines for its processing at the same time. Upon arrival of a job, its processing time and the number of requested machines become known, and it must be scheduled immediately without any knowledge of future jobs. We present a… (More)

- Deshi Ye, Guochuan Zhang
- Inf. Process. Lett.
- 2003

- Deshi Ye, Guochuan Zhang
- WAOA
- 2003

In the extensible bin packing problem we are asked to pack a set of items into a given number of bins, each with an original size. However, the original bin sizes can be extended if necessary. The goal is to minimize the total size of the bins. We consider the problem with unequal (original) bin sizes and give the complete analysis on a list scheduling… (More)