Sciweavers

8647 search results - page 252 / 1730
» The Container Selection Problem
Sort
View
158
Voted
AI
2008
Springer
15 years 3 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...
145
Voted
APPROX
2009
Springer
195views Algorithms» more  APPROX 2009»
15 years 10 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
123
Voted
CP
2008
Springer
15 years 5 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, ...
162
Voted
SIAMMA
2011
98views more  SIAMMA 2011»
14 years 10 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
122
Voted
CF
2010
ACM
15 years 8 months ago
Proposition for a sequential accelerator in future general-purpose manycore processors and the problem of migration-induced cach
As the number of transistors on a chip doubles with every technology generation, the number of on-chip cores also increases rapidly, making possible in a foreseeable future to des...
Pierre Michaud, Yiannakis Sazeides, André S...