Sciweavers

564 search results - page 16 / 113
» Corner cutting systems
Sort
View
LICS
2008
IEEE
14 years 2 months ago
On the Computational Complexity of Cut-Reduction
Using appropriate notation systems for proofs, cutreduction can often be rendered feasible on these notations. Explicit bounds can be given. Developing a suitable notation system ...
Klaus Aehlig, Arnold Beckmann
CSMR
2005
IEEE
14 years 1 months ago
Tracing Cross-Cutting Requirements via Context-Based Constraints
In complex systems, it is difficult to identify which system element is involved in which requirement. In this article, we present a new approach for expressing and validating a ...
Felix Bübl, Michael Balser
CSR
2008
Springer
13 years 7 months ago
A Triple Correspondence in Canonical Calculi: Strong Cut-Elimination, Coherence, and Non-deterministic Semantics
An (n, k)-ary quantifier is a generalized logical connective, binding k variables and connecting n formulas. Canonical systems with (n, k)-ary quantifiers form a natural class of G...
Arnon Avron, Anna Zamansky
STOC
2002
ACM
115views Algorithms» more  STOC 2002»
14 years 8 months ago
Stability of load balancing algorithms in dynamic adversarial systems
In the dynamic load balancing problem, we seek to keep the job load roughly evenly distributed among the processors of a given network. The arrival and departure of jobs is modeled...
Elliot Anshelevich, David Kempe, Jon M. Kleinberg
PVM
2005
Springer
14 years 1 months ago
A Grid-Aware Branch, Cut and Price Implementation
Abstract. This paper presents a grid-enabled system for solving largescale optimization problems. The system has been developed using Globus and MPICH-G2 grid technologies, and con...
Emilio Mancini, Sonya Marcarelli, Pierluigi Ritrov...