Sciweavers

1224 search results - page 95 / 245
» Theory decision by decomposition
Sort
View
153
Voted
WIA
2004
Springer
15 years 6 months ago
A BDD-Like Implementation of an Automata Package
In this paper we propose a new data structure, called shared automata, for representing deterministic finite automata (DFA). Shared automata admit a strong canonical form for DFA ...
Jean-Michel Couvreur
125
Voted
AIIDE
2008
15 years 3 months ago
Adaptive Spatial Reasoning for Turn-based Strategy Games
The quality of AI opponents often leaves a lot to be desired, which poses many attractive challenges for AI researchers. In this respect, Turn-based Strategy (TBS) games are of pa...
Maurice H. J. Bergsma, Pieter Spronck
70
Voted
IASTEDSEA
2004
15 years 2 months ago
A component-based reference model for web-based systems
Short time-to-market is an important requirement for developing web-based systems. Software architecture plays a critical role for time-to-market objective to be satisfied since i...
Jianyun Zhou, Tor Stålhane
107
Voted
TSP
2010
14 years 7 months ago
Zero-forcing DFE transceiver design over slowly time-varying MIMO channels using ST-GTD
This paper considers the optimization of transceivers with decision feedback equalizers (DFE) for slowly time-varying memoryless multi-input multi-output (MIMO) channels. The data ...
Chih-Hao Liu, Palghat P. Vaidyanathan
SIGSOFT
2006
ACM
15 years 6 months ago
Interpolation for data structures
Interpolation based automatic abstraction is a powerful and robust technique for the automated analysis of hardware and software systems. Its use has however been limited to contr...
Deepak Kapur, Rupak Majumdar, Calogero G. Zarba