Sciweavers

13987 search results - page 306 / 2798
» The Two Guards Problem
Sort
View
ICC
2007
IEEE
123views Communications» more  ICC 2007»
16 years 1 months ago
Redundant Coverage in Wireless Sensor Networks
Abstract— Coverage is a fundamental problem in sensor networks. In this paper, we addressed the coverage problem from two different view points and refer to them as the worst and...
Can Fang, Chor Ping Low
ALGORITHMICA
2006
93views more  ALGORITHMICA 2006»
15 years 6 months ago
Simultaneous Optimization via Approximate Majorization for Concave Profits or Convex Costs
For multi-criteria problems and problems with poorly characterized objective, it is often desirable to simultaneously approximate the optimum solution for a large class of objecti...
Ashish Goel, Adam Meyerson
ANOR
2002
93views more  ANOR 2002»
15 years 6 months ago
Cutting and Surrogate Constraint Analysis for Improved Multidimensional Knapsack Solutions
We use surrogate analysis and constraint pairing in multidimensional knapsack problems to fix some variables to zero and to separate the rest into two groups
Maria A. Osorio, Fred Glover, Peter Hammer
WSC
2007
15 years 9 months ago
A simulation-based algorithm for supply chain optimization
In a supply chain, there are wide variety of problems, such as transportation scheduling problems and warehouse location problems. These problems are independently defined as opt...
Takayuki Yoshizumi, Hiroyuki Okano
AAIM
2007
Springer
106views Algorithms» more  AAIM 2007»
15 years 10 months ago
A New Efficient Algorithm for Computing the Longest Common Subsequence
Abstract. The Longest Common Subsequence (LCS) problem is a classic and well-studied problem in computer science. The LCS problem is a common task in DNA sequence analysis with man...
M. Sohel Rahman, Costas S. Iliopoulos