Sciweavers

1529 search results - page 95 / 306
» Search Space Analysis of the Linear Ordering Problem
Sort
View
MICAI
2004
Springer
15 years 9 months ago
A Preprocessing That Combines Heuristic and Surrogate Constraint Analysis to Fix Variables in TSP
A preprocessing procedure that uses a local guided search defined in terms of a neighborhood structure to get a feasible solution (UB) and the Osorio and Glover[18, 20] exploiting ...
María Auxilio Osorio Lama, David Pinto
ICTAI
2003
IEEE
15 years 9 months ago
Eliminating Redundancies in SAT Search Trees
Conflict analysis is a powerful paradigm of backtrack search algorithms, in particular for solving satisfiability problems arising from practical applications. Accordingly, most...
Richard Ostrowski, Bertrand Mazure, Lakhdar Sais, ...
MMAS
2011
Springer
14 years 11 months ago
Scalable Bayesian Reduced-Order Models for Simulating High-Dimensional Multiscale Dynamical Systems
While existing mathematical descriptions can accurately account for phenomena at microscopic scales (e.g. molecular dynamics), these are often high-dimensional, stochastic and thei...
Phaedon-Stelios Koutsourelakis, Elias Bilionis
AUTOMATICA
2008
83views more  AUTOMATICA 2008»
15 years 4 months ago
Periodic smoothing splines
Periodic smoothing splines appear for example as generators of closed, planar curves, and in this paper they are constructed using a controlled two point boundary value problem in...
Hiroyuki Kano, Magnus Egerstedt, Hiroyuki Fujioka,...
GECCO
2003
Springer
415views Optimization» more  GECCO 2003»
15 years 9 months ago
Evolutionary Algorithms for Two Problems from the Calculus of Variations
Abstract. A brachistochrone is the path along which a weighted particle falls most quickly from one point to another, and a catenary is the smooth curve connecting two points whose...
Bryant A. Julstrom