Sciweavers

1478 search results - page 197 / 296
» Modular Complexity Analysis via Relative Complexity
Sort
View
WSC
2008
14 years 18 days ago
Efficient simulation for tail probabilities of Gaussian random fields
We are interested in computing tail probabilities for the maxima of Gaussian random fields. In this paper, we discuss two special cases: random fields defined over a finite number...
Robert J. Adler, Jose Blanchet, Jingchen Liu
FMICS
2008
Springer
13 years 12 months ago
Formal Verification of the Implementability of Timing Requirements
There has been relatively little work on the implementability of timing requirements. We have previously provided definitions of fundamental timing operators that explicitly consid...
Xiayong Hu, Mark Lawford, Alan Wassyng
IWEC
2007
13 years 11 months ago
Game Design Guided by Visual Attention
Abstract. Visual attention plays a critical role in game playing. A better understanding of the allocation of visual attention can benefit the design of game scenarios. In this pa...
Li Jie, James J. Clark
ALENEX
2004
110views Algorithms» more  ALENEX 2004»
13 years 11 months ago
Computation of a Class of COntinued Fraction Constants
There are numerous instances where mathematical constants do not admit a closed form. It is then of great interest to compute them, possibly in an efficient way. So the question i...
Loïck Lhote
CLA
2004
13 years 11 months ago
A Semi-automatic Method to Ontology Design by Using FCA
Ontology design is a complex and time-consuming process. It is extremely difficult for human experts to discover ontology from given data or texts. This paper presents a semi-autom...
Hele-Mai Haav