1878 search results - page 120 / 376 » The Vienna Abstract Machine |
83
Voted
EOR
2002
15 years 2 months ago
2002
Abstract. We present fully polynomial approximation schemes for the problem of minimizing completion time variance of a set of n jobs on a single machine. The fastest of these sche...
110
Voted
ICIRA
2009
Springer
15 years 11 days ago
2009
Springer
Abstract. Two algorithms for area coverage (for use in space applications) were evaluated using a simulator and then tested on a multi-robot society consisting of LEGO Mindstorms r...
148
Voted
ISMM
2011
Springer
14 years 5 months ago
2011
Springer
Abstract. In this paper we present a parallel algorithm for the topological watershed, suitable for a shared memory parallel architecture. On a 24-core machine an average speed-up ...
123
click to vote
ICCAD
2000
IEEE
15 years 7 months ago
2000
IEEE
Most hardware description frameworks, whether schematic or textual, use cooperating finite state machines (CFSM) as the underlying abstraction. In the CFSM framework, a designer ...
132
Voted
CAV
1998
Springer
15 years 6 months ago
1998
Springer
bstract description of state machines (ASMs), in which data and data operations are d using abstract sort and uninterpreted function symbols. ASMs are suitable for describing Regis...