Sciweavers

945 search results - page 151 / 189
» Incremental Branching Programs
Sort
View
HPDC
2010
IEEE
13 years 8 months ago
Versioning for workflow evolution
Scientists working in eScience environments often use workflows to carry out their computations. Since the workflows evolve as the research itself evolves, these workflows can be ...
Eran Chinthaka Withana, Beth Plale, Roger S. Barga...
CORR
2008
Springer
86views Education» more  CORR 2008»
13 years 7 months ago
Design by Measure and Conquer, A Faster Exact Algorithm for Dominating Set
The measure and conquer approach has proven to be a powerful tool to analyse exact algorithms for combinatorial problems, like Dominating Set and Independent Set. In this paper, we...
Johan M. M. van Rooij, Hans L. Bodlaender
AUTOMATICA
2005
93views more  AUTOMATICA 2005»
13 years 7 months ago
Steady-state performance evaluation of continuous mono-T-semiflow Petri nets
The number of states in discrete event systems can increase exponentially with respect to the size of the system. A way to face this state explosion problem consists of relaxing t...
Jorge Júlvez, Laura Recalde, Manuel Silva
JCSS
2000
116views more  JCSS 2000»
13 years 7 months ago
Time-Space Tradeoffs for Satisfiability
We give the first nontrivial model-independent time-space tradeoffs for satisfiability. Namely, we show that SAT cannot be solved simultaneously in n1+o(1) time and n1space for an...
Lance Fortnow
ICST
2010
IEEE
13 years 6 months ago
Longer is Better: On the Role of Test Sequence Length in Software Testing
In the presence of an internal state, often it is required a sequence of function calls to test software. In fact, to cover a particular branch of the code, a sequence of previous...
Andrea Arcuri