Sciweavers

1300 search results - page 129 / 260
» Constraint satisfaction problems and global cardinality cons...
Sort
View
FLAIRS
2006
14 years 11 months ago
Incremental Propagation of Time Windows on Disjunctive Resources
Constraint-based techniques are frequently used in solving real-life scheduling problems thanks to natural modeling capabilities and strong constraint propagation techniques encod...
Roman Barták
SIAMJO
2008
81views more  SIAMJO 2008»
14 years 8 months ago
A First-Order Convergence Analysis of Trust-Region Methods with Inexact Jacobians
A class of trust-region algorithms is developed and analyzed for the solution of minimization problems with nonlinear inequality constraints. Based on composite-step trust region ...
Andrea Walther
GECCO
2004
Springer
127views Optimization» more  GECCO 2004»
15 years 3 months ago
Computational Complexity and Simulation of Rare Events of Ising Spin Glasses
We discuss the computational complexity of random 2D Ising spin glasses, which represent an interesting class of constraint satisfaction problems for black box optimization. Two ex...
Martin Pelikan, Jiri Ocenasek, Simon Trebst, Matth...
ENTCS
2007
190views more  ENTCS 2007»
14 years 9 months ago
Modelling Multicast QoS Routing by using Best-Tree Search in And-or Graphs and Soft Constraint Logic Programming
We suggest a formal model to represent and solve the multicast routing problem in multicast networks. To attain this, we model the network adapting it to a weighted and-or graph, ...
Stefano Bistarelli, Ugo Montanari, Francesca Rossi...
ICRA
2005
IEEE
123views Robotics» more  ICRA 2005»
15 years 3 months ago
Stable Pushing of Assemblies
— This paper presents a method to determine whether an assembly of planar parts will stay assembled as it is pushed over a support surface. For a given pushing motion, an assembl...
Jay Bernheisel, Kevin M. Lynch