Sciweavers

89 search results - page 6 / 18
» A heuristic method for large-scale multi-facility location p...
Sort
View
ALENEX
2007
130views Algorithms» more  ALENEX 2007»
13 years 8 months ago
Locating Guards for Visibility Coverage of Polygons
We propose heuristics for visibility coverage of a polygon with the fewest point guards. This optimal coverage problem, often called the “art gallery problem”, is known to be ...
Yoav Amit, Joseph S. B. Mitchell, Eli Packer
ATMOS
2010
162views Optimization» more  ATMOS 2010»
13 years 4 months ago
Heuristics for the Traveling Repairman Problem with Profits
In the traveling repairman problem with profits, a repairman (also known as the server) visits a subset of nodes in order to collect time-dependent profits. The objective consists...
Thijs Dewilde, Dirk Cattrysse, Sofie Coene, Frits ...
CGI
2006
IEEE
14 years 24 days ago
Providing Full Awareness to Distributed Virtual Environments Based on Peer-to-Peer Architectures
In recent years, large scale distributed virtual environments (DVEs) have become a major trend in distributed applications, mainly due to the enormous popularity of multiplayer onl...
Pedro Morillo, W. Moncho, Juan M. Orduña, J...
HM
2007
Springer
137views Optimization» more  HM 2007»
14 years 27 days ago
A Hybrid VNS for Connected Facility Location
The connected facility location (ConFL) problem generalizes the facility location problem and the Steiner tree problem in graphs. Given a graph G = (V, E), a set of customers D ⊆...
Ivana Ljubic
CIKM
2008
Springer
13 years 8 months ago
Query suggestion using hitting time
Generating alternative queries, also known as query suggestion, has long been proved useful to help a user explore and express his information need. In many scenarios, such sugges...
Qiaozhu Mei, Dengyong Zhou, Kenneth Ward Church