Sciweavers

392 search results - page 26 / 79
» Maximal Completion
Sort
View
ESSLLI
1999
Springer
14 years 2 months ago
Weak Equivalence in Propositional Calculus
Abstract. The main purpose of this paper is to present a new algorithm (NEWSAT) for deciding the (un)satisfiability of propositional formulae. It is based on a somehow dual (versu...
Stefan Andrei
CSCLP
2004
Springer
14 years 3 months ago
Better Propagation for Non-preemptive Single-Resource Constraint Problems
Abstract. Overload checking, forbidden regions, edge finding, and notfirst/not-last detection are well-known propagation rules to prune the start times of activities which have t...
Armin Wolf
STOC
2005
ACM
135views Algorithms» more  STOC 2005»
14 years 10 months ago
Quadratic forms on graphs
We introduce a new graph parameter, called the Grothendieck constant of a graph G = (V, E), which is defined as the least constant K such that for every A : E R, sup f:V S|V |-1 ...
Noga Alon, Konstantin Makarychev, Yury Makarychev,...
ICDE
2006
IEEE
126views Database» more  ICDE 2006»
14 years 4 months ago
Managing the Forecast Factory
The CORIE forecast factory consists of a set of data product generation runs that are executed daily on dedicated local resources. The goal is to maximize productivity and resourc...
Laura Bright, David Maier, Bill Howe
ESOP
2009
Springer
14 years 4 months ago
Global Principal Typing in Partially Commutative Asynchronous Sessions
We generalise a theory of multiparty session types for the π-calculus through asynchronous communication subtyping, which allows partial commutativity of actions with maximal fle...
Dimitris Mostrous, Nobuko Yoshida, Kohei Honda