Sciweavers

8413 search results - page 50 / 1683
» Ordering Problem Subgoals
Sort
View
DAM
2006
66views more  DAM 2006»
13 years 8 months ago
Positivity of second order linear recurrent sequences
We give an elementary proof for the Positivity Problem for second order recurrent sequences: it is decidable whether or not a recurrent sequence defined by un = aun-1 + bun-2 has ...
Vesa Halava, Tero Harju, Mika Hirvensalo
CVPR
2009
IEEE
15 years 3 months ago
Minimizing Sparse Higher Order Energy Functions of Discrete Variables
Higher order energy functions have the ability to encode high level structural dependencies between pixels, which have been shown to be extremely powerful for image labeling pro...
Carsten Rother (Microsoft Research Cambridge), Pus...
DAM
2007
100views more  DAM 2007»
13 years 8 months ago
Partially ordered knapsack and applications to scheduling
In the partially-ordered knapsack problem (POK) we are given a set N of items and a partial order ≺P on N. Each item has a size and an associated weight. The objective is to pac...
Stavros G. Kolliopoulos, George Steiner
CP
1997
Springer
14 years 3 days ago
Ordering Constraints over Feature Trees
Feature trees have been used to accommodate records in constraint programming and record like structures in computational linguistics. Feature trees model records, and feature cons...
Martin Müller, Joachim Niehren, Andreas Podel...
CADE
2008
Springer
14 years 8 months ago
THF0 - The Core of the TPTP Language for Higher-Order Logic
One of the keys to the success of the Thousands of Problems for Theorem Provers (TPTP) problem library and related infrastructure is the consistent use of the TPTP language. This p...
Christoph Benzmüller, Florian Rabe, Geoff Sut...