Sciweavers

102 search results - page 17 / 21
» Reformulation for Extensional Reasoning
Sort
View
WEA
2010
Springer
289views Algorithms» more  WEA 2010»
14 years 2 months ago
Experiments with a Generic Dantzig-Wolfe Decomposition for Integer Programs
Abstract We report on experiments with turning the branch-price-andcut framework SCIP into a generic branch-price-and-cut solver. That is, given a mixed integer program (MIP), our ...
Gerald Gamrath, Marco E. Lübbecke
MP
2002
165views more  MP 2002»
13 years 7 months ago
A feasible semismooth asymptotically Newton method for mixed complementarity problems
Semismooth Newton methods constitute a major research area for solving mixed complementarity problems (MCPs). Early research on semismooth Newton methods is mainly on infeasible me...
Defeng Sun, Robert S. Womersley, Houduo Qi
WEBI
2010
Springer
13 years 5 months ago
A Scalable Indexing Mechanism for Ontology-Based Information Integration
In recent years, there has been an explosion of publicly available RDF and OWL web pages. Some of these pages are static text files, while others are dynamically generated from la...
Yingjie Li, Abir Qasem, Jeff Heflin
ICFP
2010
ACM
13 years 8 months ago
Logical types for untyped languages
Programmers reason about their programs using a wide variety of formal and informal methods. Programmers in untyped languages such as Scheme or Erlang are able to use any such met...
Sam Tobin-Hochstadt, Matthias Felleisen
CVPR
2008
IEEE
14 years 9 months ago
Spectrally optimal factorization of incomplete matrices
From the recovery of structure from motion to the separation of style and content, many problems in computer vision have been successfully approached by using bilinear models. The...
Pedro M. Q. Aguiar, João M. F. Xavier, Mark...