3443 search results - page 10 / 689 » More Algebras for Determiners |
HYBRID
2009
Springer
14 years 2 months ago
2009
Springer
We show that regarding finite automata (FA) as discrete, time-invariant linear systems over semimodules, allows to: (1) express FA minimization and FA determinization as particula...
HICSS
2000
IEEE
14 years 10 days ago
2000
IEEE
In this paper we claim the importance of a cognitive view of trust (its articulate, analytic and founded view), in contrast with a mere quantitative and opaque view of trust suppo...
TWC
2008
13 years 7 months ago
2008
In this paper, we consider a class of energy-aware routing algorithm that explicitly takes into account the connectivity of the remaining sensor network. In typical sensor network ...
ICLP
2003
Springer
14 years 1 months ago
2003
Springer
Abstract. In this paper we show how we can use size and groundness analyses lifted to regular and (polymorphic) Hindley/Milner typed programs to determine more accurate termination...
KBSE
2002
IEEE
14 years 25 days ago
2002
IEEE
Finite-state machine (FSM) models are commonly used to represent software with concurrent processes. Established model checking tools can be used to automatically test FSM models,...