Sciweavers

945 search results - page 77 / 189
» Working the Flow
Sort
View
FMICS
2006
Springer
14 years 1 months ago
Test Coverage for Loose Timing Annotations
Abstract. The design flow of systems-on-a-chip (SoCs) identifies several abstraction levels higher than the Register-Transfer-Level that constitutes the input of the synthesis tool...
Claude Helmstetter, Florence Maraninchi, Laurent M...
BPM
2008
Springer
155views Business» more  BPM 2008»
14 years 4 days ago
The Refined Process Structure Tree
Abstract. We consider workflow graphs as a model for the control flow of a business process model and study the problem of workflow graph parsing, i.e., finding the structure of a ...
Jussi Vanhatalo, Hagen Völzer, Jana Koehler
CORR
2010
Springer
86views Education» more  CORR 2010»
13 years 10 months ago
Online Scheduling on Identical Machines using SRPT
Due to its optimality on a single machine for the problem of minimizing average flow time, ShortestRemaining-Processing-Time (SRPT) appears to be the most natural algorithm to con...
Kyle Fox, Benjamin Moseley
COGSCI
2004
97views more  COGSCI 2004»
13 years 10 months ago
A rhythm recognition computer program to advocate interactivist perception
This paper advocates the main ideas of the interactive model of representation of Mark Bickhard and the assimilation/accommodation framework of Jean Piaget, through a rhythm recog...
Jean-Christophe Buisson
CCR
1999
68views more  CCR 1999»
13 years 9 months ago
TCP byte counting refinements
TCP's delayed acknowledgment algorithm has been shown to hurt TCP performance. One method of gaining the performance lost by reducing the number of acknowledgments sent is to...
Mark Allman