823 search results - page 8 / 165 » Stateful Subset Cover |
MSS
2008
IEEE
13 years 9 months ago
2008
IEEE
We present the first polynomial-time algorithm for computing the minimal covering set of a (weak) tournament. The algorithm draws upon a linear programming formulation of a subset...
PERCOM
2008
ACM
14 years 9 months ago
2008
ACM
This paper identifies requirements for querying and accessing context information in mobile and pervasive computing environments. Furthermore it studies existing query languages s...
ISSTA
1996
ACM
14 years 1 months ago
1996
ACM
We illustrate the application of Nitpick, a specification checker, to the design of a style mechanism for a word processor. The design is cast, along with some expected properties...
SGAI
2004
Springer
14 years 3 months ago
2004
Springer
In Wrapper based feature selection, the more states that are visited during the search phase of the algorithm the greater the likelihood of finding a feature subset that has a high...
DAC
1994
ACM
14 years 1 months ago
1994
ACM
State minimization of incompletely specifiedmachinesis an important step of FSM synthesis. An exact algorithm consists of generation of prime compatibles and solution of a binate ...