Sciweavers

2543 search results - page 103 / 509
» Optimal Ordered Problem Solver
Sort
View
SIAMMAX
2010
113views more  SIAMMAX 2010»
14 years 9 months ago
Approximate Nullspace Iterations for KKT Systems
The aim of the paper is to provide a theoretical basis for approximate reduced SQP methods. In contrast to inexact reduced SQP methods, the forward and the adjoint problem accuraci...
Kazufumi Ito, Karl Kunisch, Volker Schulz, Ilia Gh...
126
Voted
ICLP
2005
Springer
15 years 8 months ago
Towards an Integration of Answer Set and Constraint Solving
Answer set programming (ASP for short) is a declarative problem solving framework that has been recently attracting the attention of researchers for its expressiveness and for its...
Sabrina Baselice, Piero A. Bonatti, Michael Gelfon...
SAT
2010
Springer
141views Hardware» more  SAT 2010»
15 years 6 months ago
Synthesizing Shortest Linear Straight-Line Programs over GF(2) Using SAT
Non-trivial linear straight-line programs over the Galois field of two elements occur frequently in applications such as encryption or high-performance computing. Finding the shor...
Carsten Fuhs, Peter Schneider-Kamp
IPPS
2008
IEEE
15 years 9 months ago
Build to order linear algebra kernels
—The performance bottleneck for many scientific applications is the cost of memory access inside linear algebra kernels. Tuning such kernels for memory efficiency is a complex ...
Jeremy G. Siek, Ian Karlin, Elizabeth R. Jessup
ECCV
2010
Springer
15 years 8 months ago
TriangleFlow: Optical Flow with Triangulation-based Higher-Order Likelihoods
Abstract. We use a simple yet powerful higher-order conditional random field (CRF) to model optical flow. It consists of a standard photoconsistency cost and a prior on affine mo...