15792 search results - page 2811 / 3159 » Computational Abstraction Steps |
213
click to vote
DLOG
2008
15 years 9 months ago
2008
Abstract. Fuzzy Description Logics (f-DLs) have been proposed as extensions of classical Description Logics able to handle imprecise and vague knowledge. Although several extension...
186
click to vote
APLAS
2008
ACM
15 years 8 months ago
2008
ACM
Abstract. Symbolic execution is a flexible and powerful, but computationally expensive technique to detect dynamic behaviors of a program. In this paper, we present a context-sensi...
232
click to vote
APPROX
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. We give a (ln n + 1)-approximation for the decision tree (DT) problem. An instance of DT is a set of m binary tests T = (T1, . . . , Tm) and a set of n items X = (X1, . ....
206
click to vote
ECBS
2010
IEEE
15 years 8 months ago
2010
IEEE
—One of the ideas of agile software development is to respond to changes rather than following a plan. Constantly changing businesses result in changing requirements, to be handl...
222
click to vote
ARC
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. Financial applications are one of many fields where a multivariate Gaussian random number generator plays a key role in performing computationally extensive simulations. ...