Sciweavers

425 search results - page 66 / 85
» Requirements, specifications, and minimal refinement
Sort
View
EJC
2010
13 years 7 months ago
On the distance between the expressions of a permutation
Abstract. We prove that the combinatorial distance between any two reduced expressions of a given permutation of {1, ..., n} in terms of transpositions lies in O(n4), a sharp bound...
Patrick Dehornoy, Marc Autord
IS
2008
13 years 7 months ago
Integration of complex archeology digital libraries: An ETANA-DL experience
In this paper, we formalize the digital library (DL) integration problem and propose an overall approach based on the 5S (streams, structures, spaces, scenarios, and societies) fr...
Rao Shen, Naga Srinivas Vemuri, Weiguo Fan, Edward...
IJFCS
2006
119views more  IJFCS 2006»
13 years 7 months ago
Enforcing Concurrent Temporal Behaviors
The outcome of verifying software is often a `counterexample', i.e., a listing of the actions and states of a behavior not satisfying the specification. In order to understan...
Doron Peled, Hongyang Qu
JCP
2008
118views more  JCP 2008»
13 years 7 months ago
Power-efficient Instruction Encoding Optimization for Various Architecture Classes
A huge application domain, in particular, wireless and handheld devices strongly requires flexible and powerefficient hardware with high performance. This can only be achieved with...
Diandian Zhang, Anupam Chattopadhyay, David Kammle...
TCBB
2008
113views more  TCBB 2008»
13 years 7 months ago
Efficient Algorithms for the Computational Design of Optimal Tiling Arrays
The representation of a genome by oligonucleotide probes is a prerequisite for the analysis of many of its basic properties, such as transcription factor binding sites, chromosomal...
Alexander Schliep, Roland Krause