Sciweavers

14548 search results - page 397 / 2910
» The Optimal Path-Matching Problem
Sort
View
IPL
2008
61views more  IPL 2008»
15 years 6 months ago
Online chasing problems for regular polygons
We consider a server location problem with only one server to move. In this paper we assume that a request is given as a region and that the service can be done anywhere inside th...
Hiroshi Fujiwara, Kazuo Iwama, Kouki Yonezawa
174
Voted
JACM
2006
92views more  JACM 2006»
15 years 6 months ago
The generalized two-server problem
We consider the generalized on-line two-server problem in which at each step each server receives a request, which is a point in a metric space. One of the servers has to be moved ...
René A. Sitters, Leen Stougie
EOR
2007
159views more  EOR 2007»
15 years 6 months ago
Solving the semi-desirable facility location problem using bi-objective particle swarm
In this paper, a new model for the semi-obnoxious facility location problem is introduced. The new model is composed of a weighted minisum function to represent the transportation...
Haluk Yapicioglu, Alice E. Smith, Gerry V. Dozier
JSYML
2002
64views more  JSYML 2002»
15 years 6 months ago
Blowing up The Power Set of The Least Measurable
Abstract. We prove some results related to the problem of blowing up the power set of the least measurable cardinal. Our forcing results improve those of [1] by using the optimal h...
Arthur W. Apter, James Cummings
GC
2010
Springer
15 years 5 months ago
Star-Uniform Graphs
A star-factor of a graph is a spanning subgraph each of whose components is a star. A graph
Mikio Kano, Yunjian Wu, Qinglin Yu