Sciweavers

2786 search results - page 23 / 558
» A Practical Technique for Process Abstraction
Sort
View
CAISE
2006
Springer
15 years 5 months ago
A Process-Ontological Model for Software Engineering
Abstract. The term of a "process" is used in Software Engineering (SE) theories and practices in many different ways, which cause confusion. In this paper we will firstly...
Jari Palomäki, Harri Keto
WDAG
2005
Springer
80views Algorithms» more  WDAG 2005»
15 years 7 months ago
Obstruction-Free Algorithms Can Be Practically Wait-Free
Abstract. The obstruction-free progress condition is weaker than previous nonblocking progress conditions such as lock-freedom and waitfreedom, and admits simpler implementations t...
Faith Ellen Fich, Victor Luchangco, Mark Moir, Nir...
ESA
2007
Springer
122views Algorithms» more  ESA 2007»
15 years 5 months ago
A Practical Efficient Fptas for the 0-1 Multi-objective Knapsack Problem
Abstract. In the present work, we are interested in the practical behavior of a new fptas to solve the approximation version of the 0-1 multiobjective knapsack problem. Nevertheles...
Cristina Bazgan, Hadrien Hugot, Daniel Vanderpoote...
ACL
2001
15 years 2 months ago
Practical Issues in Compiling Typed Unification Grammars for Speech Recognition
Current alternatives for language modeling are statistical techniques based on large amounts of training data, and hand-crafted context-free or finite-state grammars that are diff...
John Dowding, Beth Ann Hockey, Jean Mark Gawron, C...
FLOPS
2006
Springer
15 years 5 months ago
Defining and Reasoning About Recursive Functions: A Practical Tool for the Coq Proof Assistant
Abstract. We present a practical tool for defining and proving properties of recursive functions in the Coq proof assistant. The tool generates from pseudo-code the graph of the in...
Gilles Barthe, Julien Forest, David Pichardie, Vla...