Sciweavers

594 search results - page 41 / 119
» Travelling Miser Problem
Sort
View
ADHOCNOW
2010
Springer
13 years 5 months ago
On Minimizing the Sum of Sensor Movements for Barrier Coverage of a Line Segment
A set of sensors establishes barrier coverage of a given line segment if every point of the segment is within the sensing range of a sensor. Given a line segment I, n mobile sensor...
Jurek Czyzowicz, Evangelos Kranakis, Danny Krizanc...
VR
2011
IEEE
376views Virtual Reality» more  VR 2011»
12 years 11 months ago
Self-motion illusions in immersive virtual reality environments
Motion perception in immersive virtual reality environments significantly differs from the real world. For example, previous work has shown that users tend to underestimate trave...
Gerd Bruder, Frank Steinicke, Phil Wieland
DMGT
2011
94views more  DMGT 2011»
12 years 11 months ago
Closed k-stop distance in graphs
The Traveling Salesman Problem (TSP) is still one of the most researched topics in computational mathematics, and we introduce a variant of it, namely the study of the closed k-wa...
Grady Bullington, Linda Eroh, Ralucca Gera, Steven...
WEA
2009
Springer
103views Algorithms» more  WEA 2009»
14 years 2 months ago
Pareto Paths with SHARC
Abstract. Up to now, research on speed-up techniques for DIJKSTRA’s algorithm focused on single-criteria scenarios. The goal was to find the quickest route within a transportati...
Daniel Delling, Dorothea Wagner
MSOM
2008
103views more  MSOM 2008»
13 years 7 months ago
Facility Location with Stochastic Demand and Constraints on Waiting Time
We analyze the problem of optimal location of a set of facilities in the presence of stochastic demand and congestion. Customers travel to the closest facility to obtain service; ...
Opher Baron, Oded Berman, Dmitry Krass