Sciweavers

551 search results - page 8 / 111
» The Complexity of Andersen's Analysis in Practice
Sort
View
DAM
1999
100views more  DAM 1999»
13 years 6 months ago
Complexity Analysis of Propositional Resolution with Autarky Pruning
An algorithm called Modoc", which has been introduced elsewhere, enhances propositional model elimination with autarky pruning, and other features. The model elimination meth...
Allen Van Gelder
EXPERT
2002
129views more  EXPERT 2002»
13 years 6 months ago
Modeling and Simulating Work Practice: A Method for Work Systems Design
er than abstracting human behavior as work processes or tasks--functional idealizations of the work to be accomplished--we model people's activities comprehensively and chrono...
Maarten Sierhuis, William J. Clancey
AGILEDC
2007
IEEE
14 years 1 months ago
On the Sustained Use of a Test-Driven Development Practice at IBM
Test-Driven Development (TDD) is an agile practice that is widely accepted and advocated by most agile methods and methodologists. In this paper, we report on a post hoc analysis ...
Julio Cesar Sanchez, Laurie A. Williams, E. Michae...
CASC
2011
Springer
262views Mathematics» more  CASC 2011»
12 years 6 months ago
Practical Divide-and-Conquer Algorithms for Polynomial Arithmetic
We investigate two practical divide-and-conquer style algorithms for univariate polynomial arithmetic. First we revisit an algorithm originally described by Brent and Kung for comp...
William Hart, Andrew Novocin
ICRE
1998
IEEE
13 years 11 months ago
Scenario Usage in System Development: A Report on Current Practice
: Scenario-based approaches are becoming ubiquitous in systems analysis and design but their definition and scope remain vague. Complementing the recently proposed CREWS classifica...
Klaus Weidenhaupt, Klaus Pohl, Matthias Jarke, Pet...