Sciweavers

4266 search results - page 134 / 854
» The container loading problem
Sort
View
117
Voted
COCOON
2008
Springer
15 years 4 months ago
Approximating the Generalized Capacitated Tree-Routing Problem
In this paper, we introduce the generalized capacitated tree-routing problem (GCTR), which is described as follows. Given a connected graph G = (V, E) with a sink s V and a set M...
Ehab Morsy, Hiroshi Nagamochi
152
Voted
AI
2008
Springer
15 years 2 months ago
Solving quantified constraint satisfaction problems
We make a number of contributions to the study of the Quantified Constraint Satisfaction Problem (QCSP). The QCSP is an extension of the constraint satisfaction problem that can b...
Ian P. Gent, Peter Nightingale, Andrew G. D. Rowle...
138
Voted
APPROX
2009
Springer
195views Algorithms» more  APPROX 2009»
15 years 9 months ago
Approximating Node-Connectivity Augmentation Problems
The (undirected) Node Connectivity Augmentation (NCA) problem is: given a graph J = (V, EJ ) and connectivity requirements {r(u, v) : u, v ∈ V }, find a minimum size set I of n...
Zeev Nutov
114
Voted
CP
2008
Springer
15 years 4 months ago
Elicitation Strategies for Fuzzy Constraint Problems with Missing Preferences: Algorithms and Experimental Studies
Fuzzy constraints are a popular approach to handle preferences and over-constrained problems in scenarios where one needs to be cautious, such as in medical or space applications. ...
Mirco Gelain, Maria Silvia Pini, Francesca Rossi, ...
145
Voted
SIAMMA
2011
98views more  SIAMMA 2011»
14 years 9 months ago
Time-Periodic Linearized Solutions of the Compressible Euler Equations and a Problem of Small Divisors
It has been unknown since the time of Euler whether or not time-periodic sound wave propagation is physically possible in the compressible Euler equations, due mainly to the ubiqui...
Blake Temple, Robin Young