Sciweavers

1094 search results - page 182 / 219
» On Computing Explanations in Argumentation
Sort
View
CANDT
2009
14 years 1 months ago
And the ringleaders were banned: an examination of protest in virtual worlds
Protest has made the jump between the offline and the online spaces and is frequently used in most virtual worlds available today. Despite the frequency of these protest actions i...
Bridget Marie Blodgett
COCO
1991
Springer
112views Algorithms» more  COCO 1991»
14 years 1 months ago
Randomized vs.Deterministic Decision Tree Complexity for Read-Once Boolean Functions
We consider the deterministic and the randomized decision tree complexities for Boolean functions, denoted DC(f) and RC(f), respectively. A major open problem is how small RC(f) ca...
Rafi Heiman, Avi Wigderson
ICALP
2010
Springer
13 years 12 months ago
Parameterized Modal Satisfiability
We investigate the parameterized computational complexity of the satisfiability problem for modal logic and attempt to pinpoint relevant structural parameters which cause the probl...
Antonis Achilleos, Michael Lampis, Valia Mitsou
ISSTA
2007
ACM
13 years 11 months ago
Experimental assessment of random testing for object-oriented software
Progress in testing requires that we evaluate the effectiveness of testing strategies on the basis of hard experimental evidence, not just intuition or a priori arguments. Random ...
Ilinca Ciupa, Andreas Leitner, Manuel Oriol, Bertr...
DAGSTUHL
2010
13 years 11 months ago
Model-Based Visualization for Intervention Planning
Computer support for intervention planning is a two-stage process: In a first stage, the relevant segmentation target structures are identified and delineated. In a second stage, ...
Bernhard Preim