Sciweavers

628 search results - page 6 / 126
» The minimum shift design problem
Sort
View
WG
2000
Springer
13 years 11 months ago
Budget Constrained Minimum Cost Connected Medians
Several practical instances of network design and location theory problems require the network to satisfy multiple constraints. In this paper, we address graph-theoretic problems t...
Goran Konjevod, Sven Oliver Krumke, Madhav V. Mara...
WSC
2004
13 years 8 months ago
Automation of Human Decision Processes for Route Completion for Airspace Design Analysis
This paper describes an algorithm for approximating missing data in air traffic routes thereby allowing the lengths of different routes to be compared for our simulation analyses....
Lisa A. Schaefer
OL
2011
277views Neural Networks» more  OL 2011»
13 years 2 months ago
An exact algorithm for minimum CDS with shortest path constraint in wireless networks
In this paper, we study a minimum Connected Dominating Set problem (CDS) in wireless networks, which selects a minimum CDS with property that all intermediate nodes inside every pa...
Ling Ding, Xiaofeng Gao, Weili Wu, Wonjun Lee, Xu ...
HICSS
2006
IEEE
140views Biometrics» more  HICSS 2006»
14 years 1 months ago
Programming Education in the Era of the Internet: A Paradigm Shift
Over the last several years, the Computer Science (CS) community has put a great deal of effort in to the area of security research, and have made great advances. Counterintuitive...
Scott Harrison, Nadine Hanebutte, Jim Alves-Foss
CATA
2004
13 years 8 months ago
Optimal Trees for the Parametric Fixed Charge Shortest Paths Problem
We investigate a variant of the Fixed Charge Shortest Paths problem which enumerates the sequence of optimal solutions that arise as the focus shifts from the fixed cost parameter...
Fred J. Rispoli, Steven Cosares