6110 search results - page 834 / 1222 » Approximate Computing |
175
click to vote
ICTAC
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. Given a nite state machine denoting the speci cation of a system, nding some short interaction sequences capable to reach some/all states or transitions of this machine...
193
click to vote
RANDOM
1998
Springer
15 years 11 months ago
1998
Springer
We are given a sequence of items that can be packed into m unit size bins. In the classical bin packing problem we x the size of the bins and try to pack the items in the minimum ...
208
click to vote
STOC
1995
ACM
15 years 10 months ago
1995
ACM
Genomes frequently evolve by reversals (i, j) that transform a gene order 1 . . . iiϩ1 . . . jϪ1j . . . n into 1 . . . ijϪ1 . . . iϩ1j . . ....
201
Voted
EDBT
2006
ACM
16 years 6 months ago
2006
ACM
In [12] we introduce a novel architecture for data processing, based on a functional fusion between a data and a computation layer. In this demo we show how this architecture is le...
203
Voted
HYBRID
2001
Springer
15 years 11 months ago
2001
Springer
It has been observed that there are a variety of situations in which the most popular hybrid simulation methods can fail to properly detect the occurrence of discrete events. In th...