Sciweavers

2181 search results - page 46 / 437
» The restriction scaffold problem
Sort
View
OR
2010
Springer
13 years 3 months ago
A new multi-objective optimization formulation for rail-car fleet sizing problems
Abstract With potential application to a variety of industries, fleet sizing problems present a prevalent and significant challenge for engineers and managers. This is especially t...
Hamid Reza Sayarshad, Timothy Marler
CDC
2008
IEEE
150views Control Systems» more  CDC 2008»
14 years 3 months ago
Subgradient methods and consensus algorithms for solving convex optimization problems
— In this paper we propose a subgradient method for solving coupled optimization problems in a distributed way given restrictions on the communication topology. The iterative pro...
Björn Johansson, Tamás Keviczky, Mikae...
IPPS
2006
IEEE
14 years 2 months ago
Coordinate transformation - a solution for the privacy problem of location based services?
Protecting location information of mobile users in Location Based Services (LBS) is a very important but quite difficult and still largely unsolved problem. Location information h...
Andreas Gutscher
COCO
2004
Springer
133views Algorithms» more  COCO 2004»
14 years 2 months ago
Parameterized Complexity of Constraint Satisfaction Problems
We prove a parameterized analog of Schaefer’s Dichotomy Theorem: we show that for every finite boolean constraint family F, deciding whether a formula containing constraints fr...
Dániel Marx
FAW
2008
Springer
104views Algorithms» more  FAW 2008»
13 years 10 months ago
The Parameterized Complexity of the Rectangle Stabbing Problem and Its Variants
We study the parameterized complexity of an NP-complete geometric covering problem called d-dimensional Rectangle Stabbing where we are given a set of axis-parallel d-dimensional h...
Michael Dom, Somnath Sikdar