Sciweavers

351 search results - page 46 / 71
» Classical proof forestry
Sort
View
DISOPT
2008
78views more  DISOPT 2008»
13 years 7 months ago
N-fold integer programming
In this article we study a broad class of integer programming problems in variable dimension. We show that these so-termed n-fold integer programming problems are polynomial time ...
Jesús A. De Loera, Raymond Hemmecke, Shmuel...
AMAI
2006
Springer
13 years 7 months ago
On a rule-based interpretation of default conditionals
In nonmonotonic reasoning, a default conditional has most often been informally interpreted as a defeasible version of a classical conditional, usually the material conditional...
James P. Delgrande
COMBINATORICS
2006
221views more  COMBINATORICS 2006»
13 years 7 months ago
Kernels of Directed Graph Laplacians
Abstract. Let G denote a directed graph with adjacency matrix Q and indegree matrix D. We consider the Kirchhoff matrix L = D - Q, sometimes referred to as the directed Laplacian. ...
John S. Caughman IV, J. J. P. Veerman
CORR
2006
Springer
93views Education» more  CORR 2006»
13 years 7 months ago
Free Choice Petri Nets without frozen tokens and Bipolar Synchronization Systems
Bipolar synchronization systems (BP-systems) constitute a class of coloured Petri nets, well suited for modelling the control flow of discrete dynamical systems. Every BP-system ha...
Joachim Wehler
ENTCS
2006
124views more  ENTCS 2006»
13 years 7 months ago
Generic Trace Theory
Trace semantics has been defined for various non-deterministic systems with different input/output types, or with different types of "non-determinism" such as classical ...
Ichiro Hasuo, Bart Jacobs, Ana Sokolova