Sciweavers

879 search results - page 79 / 176
» A Constraint Programming Approach for the Service Consolidat...
Sort
View
STOC
1995
ACM
145views Algorithms» more  STOC 1995»
15 years 4 months ago
Polynomial time approximation schemes for dense instances of NP-hard problems
We present a unified framework for designing polynomial time approximation schemes (PTASs) for “dense” instances of many NP-hard optimization problems, including maximum cut,...
Sanjeev Arora, David R. Karger, Marek Karpinski
COR
2010
155views more  COR 2010»
15 years 22 days ago
A memetic algorithm for the multi-compartment vehicle routing problem with stochastic demands
The Multi-Compartment Vehicle Routing Problem (MC-VRP) consists of designing transportation routes to satisfy the demands of a set of costumers for several products that because o...
Jorge E. Mendoza, Bruno Castanier, Christelle Gu&e...
CDC
2010
IEEE
151views Control Systems» more  CDC 2010»
14 years 7 months ago
Convergence of discrete-time approximations of constrained linear-quadratic optimal control problems
Abstract-- Continuous-time linear constrained optimal control problems are in practice often solved using discretization techniques, e.g. in model predictive control (MPC). This re...
Lanshan Han, M. Kanat Camlibel, Jong-Shi Pang, W. ...
112
Voted
CCGRID
2002
IEEE
15 years 5 months ago
Overcoming the Problems Associated with the Existence of Too Many DSM APIs
Despite the large research efforts in the SW–DSM community, this technology has not yet been adapted widely for significant codes beyond benchmark suites. One of the reasons co...
Martin Schulz
93
Voted
UM
2007
Springer
15 years 6 months ago
Respecting Users' Individual Privacy Constraints in Web Personalization
Web personalization has demonstrated to be advantageous for both online customers and vendors. However, its benefits may be severely counteracted by privacy constraints. Personaliz...
Yang Wang 0005, Alfred Kobsa