1670 search results - page 177 / 334 » On Skolemization in constructive theories |
133
click to vote
ESA
2007
Springer
16 years 21 days ago
2007
Springer
Abstract. We present a new algorithm that can output the rankdecomposition of width at most k of a graph if such exists. For that we use an algorithm that, for an input matroid rep...
171
click to vote
ICALP
2007
Springer
16 years 20 days ago
2007
Springer
Abstract. We give an fpt approximation algorithm for the directed vertex disjoint cycle problem. Given a directed graph G with n vertices and a positive integer k, the algorithm co...
143
click to vote
ICARIS
2007
Springer
2007
Springer
Modeling Migration, Compartmentalization and Exit of Naive T Cells in Lymph Nodes Without Chemotaxis
16 years 20 days ago
The migration of lymphocytes through secondary lymphoid organs was believed to be mainly controlled by chemokine gradients. This theory has recently been called into question since...
152
click to vote
MFCS
2007
Springer
16 years 20 days ago
2007
Springer
In computability theory, program self-reference is formalized by the not-necessarily-constructive form of Kleene’s Recursion Theorem (krt). In a programming system in which krt h...
152
click to vote
PEPM
2007
ACM
16 years 19 days ago
2007
ACM
Visual notations are pervasive in circuit design, control systems, and increasingly in mainstream programming environments. Yet many of the foundational advances in programming la...