Sciweavers

4266 search results - page 113 / 854
» The container loading problem
Sort
View
PRICAI
1998
Springer
15 years 10 months ago
Dynamic Constraint Weighting for Over-Constrained Problems
Many real-world constraint satisfaction problems (CSPs) can be over-constrained but contain a set of mandatory or hard constraints that have to be satisfied for a solution to be ac...
John Thornton, Abdul Sattar
IPCO
2010
148views Optimization» more  IPCO 2010»
15 years 7 months ago
Prize-Collecting Steiner Network Problems
In the Steiner Network problem we are given a graph with edge-costs and connectivity requirements between node pairs , . The goal is to find a minimum-cost subgraph of that contain...
MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kor...
COR
2006
120views more  COR 2006»
15 years 6 months ago
A hybrid setup for a hybrid scenario: combining heuristics for the home health care problem
Home health care, i.e. visiting and nursing patients in their homes, is a growing sector in the medical service business. From a staff rostering point of view, the problem is to f...
Stefan Bertels, Torsten Fahle
ICDCS
2009
IEEE
16 years 3 months ago
Modeling Probabilistic Measurement Correlations for Problem Determination in Large-Scale Distributed Systems
With the growing complexity in computer systems, it has been a real challenge to detect and diagnose problems in today’s large-scale distributed systems. Usually, the correlatio...
Jing Gao, Guofei Jiang, Haifeng Chen, Jiawei Han
AAIM
2008
Springer
96views Algorithms» more  AAIM 2008»
16 years 20 days ago
Minimum Leaf Out-Branching Problems
Abstract. Given a digraph D, the Minimum Leaf Out-Branching problem (MinLOB) is the problem of finding in D an out-branching with the minimum possible number of leaves, i.e., vert...
Gregory Gutin, Igor Razgon, Eun Jung Kim