644 search results - page 52 / 129 » Decomposition Complexity |
83
Voted
CHI
2002
ACM
16 years 29 days ago
2002
ACM
CPM-GOMS is a modeling method that combines the task decomposition of a GOMS analysis with a model of human resource usage at the level of cognitive, perceptual, and motor operati...
115
Voted
STACS
2010
Springer
15 years 7 months ago
2010
Springer
The Graph Isomorphism problem restricted to graphs of bounded treewidth or bounded tree distance width are known to be solvable in polynomial time [2],[19]. We give restricted spa...
113
Voted
QEST
2009
IEEE
15 years 7 months ago
2009
IEEE
—The departure process of a BMAP/MAP/1 queue can be approximated in different ways: as a Markovian arrival process (MAP) or as a matrix-exponential process (MEP). Both approximat...
103
Voted
COMPGEOM
2009
ACM
15 years 7 months ago
2009
ACM
We revisit the problem of computing the topology and geometry of a real algebraic plane curve. The topology is of prime interest but geometric information, such as the position of...
110
Voted
FPL
1999
Springer
15 years 4 months ago
1999
Springer
This paper details the development, implementation, and results of Synthia, a system for the synthesis of Finite State Machines (FSMs) to field-programmable logic. Our approach us...