Sciweavers

1456 search results - page 25 / 292
» Two Techniques to Improve Finite Model Search
Sort
View
ASE
2006
123views more  ASE 2006»
13 years 7 months ago
Separating sequence overlap for automated test sequence generation
Finite state machines have been used to model a number of classes of system and there has thus been much interest in the automatic generation of test sequences from finite state m...
Robert M. Hierons
VTC
2010
IEEE
163views Communications» more  VTC 2010»
13 years 6 months ago
An ARQ Mechanism with Rate Control for Two-Hop Relaying Systems
— Wireless multi-hop relaying has been attracting considerable attention as a promising technique for future communication systems. The multi-hop relaying technique has many bene...
Soo-Yong Jeon, Dong-Ho Cho
AI
2002
Springer
13 years 7 months ago
Improving heuristic mini-max search by supervised learning
This article surveys three techniques for enhancing heuristic game-tree search pioneered in the author's Othello program Logistello, which dominated the computer Othello scen...
Michael Buro
IPPS
2009
IEEE
14 years 2 months ago
A fusion-based approach for tolerating faults in finite state machines
Given a set of n different deterministic finite state machines (DFSMs) modeling a distributed system, we examine the problem of tolerating f crash or Byzantine faults in such a ...
Vinit A. Ogale, Bharath Balasubramanian, Vijay K. ...
CPAIOR
2008
Springer
13 years 9 months ago
The Accuracy of Search Heuristics: An Empirical Study on Knapsack Problems
Theoretical models for the evaluation of quickly improving search strategies, like limited discrepancy search, are based on specific assumptions regarding the probability that a va...
Daniel H. Leventhal, Meinolf Sellmann