Sciweavers

3820 search results - page 95 / 764
» Bounded Model Debugging
Sort
View
CORR
2010
Springer
80views Education» more  CORR 2010»
14 years 9 months ago
Distributed Deterministic Edge Coloring using Bounded Neighborhood Independence
We study the edge-coloring problem in the message-passing model of distributed computing. This is one of the most fundamental problems in this area. Currently, the best-known dete...
Leonid Barenboim, Michael Elkin
114
Voted
SKG
2006
IEEE
15 years 8 months ago
Dynamic Setting, Verification and Adjustment of Upper Bound Constraints in Grid Workflow Systems
Upper bound constraints are often set when complex scientific or business processes are modelled as grid workflow specifications. However, many existing processes such as climate ...
Jinjun Chen, Yun Yang
120
Voted
CIE
2006
Springer
15 years 6 months ago
Forcing with Random Variables and Proof Complexity
or representation theory of groups), and even borrows abstract geometrical concepts like Euler characteristic or Grothendieck ring. However, the most stimulating for proof complexi...
Jan Krajícek
WSC
2007
15 years 4 months ago
Path-wise estimators and cross-path regressions: an application to evaluating portfolio strategies
Recently developed dual techniques allow us to evaluate a given sub-optimal dynamic portfolio policy by using the policy to construct an upper bound on the optimal value function....
Martin B. Haugh, Ashish Jain
128
Voted
CORR
2010
Springer
149views Education» more  CORR 2010»
15 years 2 months ago
Lower Bounds for the Complexity of Monadic Second-Order Logic
Courcelle's famous theorem from 1990 states that any property of graphs definable in monadic second-order logic (MSO2) can be decided in linear time on any class of graphs of ...
Stephan Kreutzer, Siamak Tazari