Sciweavers

2370 search results - page 291 / 474
» A Structured Set of Higher-Order Problems
Sort
View
TEC
2008
150views more  TEC 2008»
15 years 3 months ago
AbYSS: Adapting Scatter Search to Multiobjective Optimization
We propose the use of a new algorithm to solve multiobjective optimization problems. Our proposal adapts the well-known scatter search template for single objective optimization to...
Antonio J. Nebro, Francisco Luna, Enrique Alba, Be...
JAIR
2007
107views more  JAIR 2007»
15 years 3 months ago
Compressed Pattern Databases
A pattern database (PDB) is a heuristic function implemented as a lookup table that stores the lengths of optimal solutions for subproblem instances. Standard PDBs have a distinct...
Ariel Felner, Richard E. Korf, Ram Meshulam, Rober...
SIAMJO
2000
74views more  SIAMJO 2000»
15 years 3 months ago
A Specialized Interior-Point Algorithm for Multicommodity Network Flows
Abstract. Despite the efficiency shown by interior-point methods in large-scale linear programming, they usually perform poorly when applied to multicommodity flow problems. The ne...
Jordi Castro
ICRA
2010
IEEE
135views Robotics» more  ICRA 2010»
15 years 2 months ago
Implicit nonlinear complementarity: A new approach to contact dynamics
— Contact dynamics are commonly formulated as a linear complementarity problem. While this approach is superior to earlier spring-damper models, it can be inaccurate due to pyram...
Emanuel Todorov
SIAMCOMP
2010
120views more  SIAMCOMP 2010»
15 years 2 months ago
Edge Disjoint Paths in Moderately Connected Graphs
Abstract. We study the Edge Disjoint Paths (EDP) problem in undirected graphs: Given a graph G with n nodes and a set T of pairs of terminals, connect as many terminal pairs as pos...
Satish Rao, Shuheng Zhou