Sciweavers

169 search results - page 1 / 34
» Application of computational geometry to network p-center lo...
Sort
View
CCCG
2008
13 years 9 months ago
Application of computational geometry to network p-center location problems
In this paper we showed that a p( 2)-center location problem in general networks can be transformed to the well known Klee's measure problem [5]. This resulted in an improved...
Qiaosheng Shi, Binay K. Bhattacharya
AINA
2007
IEEE
13 years 11 months ago
Domain Modelling for Ubiquitous Computing Applications
Many Ubiquitous computing applications can be considered as planning and acting problems in environments characterised by uncertainty and partial observability. Such systems rely ...
Anthony Harrington, Vinny Cahill
FSTTCS
2009
Springer
14 years 2 months ago
Donation Center Location Problem
We introduce and study the donation center location problem, which has an additional application in network testing and may also be of independent interest as a general graph-theor...
Chien-Chung Huang, Zoya Svitkina
WAE
2000
95views Algorithms» more  WAE 2000»
13 years 8 months ago
Two-Dimensional Arrangements in CGAL and Adaptive Point Location for Parametric Curves
Given a collection C of curves in the plane, the arrangement of C is the subdivision of the plane into vertices, edges and faces induced by the curves in C. Constructing arrangemen...
Iddo Hanniel, Dan Halperin
FOCS
2008
IEEE
14 years 1 months ago
Dynamic Connectivity: Connecting to Networks and Geometry
Dynamic connectivity is a well-studied problem, but so far the most compelling progress has been confined to the edge-update model: maintain an understanding of connectivity in a...
Timothy M. Chan, Mihai Patrascu, Liam Roditty