Sciweavers

14548 search results - page 364 / 2910
» The Optimal Path-Matching Problem
Sort
View
175
Voted
CORR
2007
Springer
120views Education» more  CORR 2007»
15 years 6 months ago
Random subcubes as a toy model for constraint satisfaction problems
We present an exactly solvable random-subcube model inspired by the structure of hard constraint satisfaction and optimization problems. Our model reproduces the structure of the s...
Thierry Mora, Lenka Zdeborová
162
Voted
JGO
2008
90views more  JGO 2008»
15 years 6 months ago
A scaling algorithm for polynomial constraint satisfaction problems
Abstract. Good scaling is an essential requirement for the good behavior of many numerical algorithms. In particular, for problems involving multivariate polynomials, a change of s...
Ferenc Domes, Arnold Neumaier
CDC
2008
IEEE
121views Control Systems» more  CDC 2008»
16 years 1 months ago
Convex relaxations for quadratic distance problems
This paper deals with convex relaxations for quadratic distance problems, a class of optimization problems relevant to several important topics in the analysis and synthesis of ro...
Andrea Garulli, Alfio Masi, Antonio Vicino
IAT
2005
IEEE
16 years 10 days ago
Decomposition Techniques for a Loosely-Coupled Resource Allocation Problem
We are interested by contributing to stochastic problems of which the main distinction is that some tasks may create other tasks. In particular, we present a first approach which...
Pierrick Plamondon, Brahim Chaib-draa, Abder Rezak...
GECCO
2003
Springer
15 years 12 months ago
What Makes a Problem GP-Hard? Validating a Hypothesis of Structural Causes
Abstract. This paper provides an empirical test of a hypothesis, which describes the effects of structural mechanisms in genetic programming. In doing so, the paper offers a test p...
Jason M. Daida, Hsiaolei Li, Ricky Tang, Adam M. H...