نتایج جستجو برای: treatmeant approach

تعداد نتایج: 1289846  

2005
Denis Hatebur Maritta Heisel

We present two (?) problem frames that serve to structure, characterize and analyze software development problems in the area of software and system security. These problem frames constitute patterns for representing security problems, variants of which occur frequently in practice. Solving such problems starts with the development of an appropriate software architecture. To support that proces...

Journal: :AI Magazine 1995
Martha E. Pollack

Within the past three years, several new AI textbooks have been published, all written by well-known researchers (Dean, Allen, and Aloiminos 1995; Russell and Norvig 1995; Shoham 1994; Ginsberg 1993). Thus, it is not surprising that the authors of each of these textbooks have sought a way to distinguish their own book from the rest. The hook for Stuart Russell and Peter Norvig's new textbook, A...

2012
Gareth M. James Wenguang Sun Xinghao Qiao

We discuss the advantages and disadvantages of a functional approach to clustering of spatial-temporal data. This leads us to suggest an alternative methodology which allows cluster memberships to vary over both temporal and spacial domains. One advantage of our approach is that it can easily incorporate time-varying covariates. A fitting algorithm is developed and we provide a simple simulatio...

2007
Sarah P. W. Shek Choon-Ling Sia Probir Banerjee

Rapid advances in hand-held computing and communication capabilities, decreasing cost of mobile devices, and emergence of standards are fuelling the growth of mobile distributed work arrangement (DWA) in business operations. However, mobile DWA is more than a technological arrangement; it is an organizational innovation that could involve structural and administrative changes in the organizatio...

2004
Richard J. Gaylord

Abst ract The functional approach to scientiic computing is illustrated using various random walk models and the Mathematica programming language.

2003
Paolo Ghirardato Fabio Maccheroni Massimo Marinacci Marciano Siniscalchi

We provide a simple behavioral definition of ‘subjective mixture’ of acts for a large class of (not necessarily expected-utility) preferences. Subjective mixtures enjoy the same algebraic properties as the ‘objective mixtures’ used to great advantage in the decision setting introduced by Anscombe and Aumann (1963). This makes it possible to formulate mixture-space axioms in a fully subjective s...

2006
Maria Lencastre Keldjan Alves Renata Cristina Faray Melo Fernanda M. R. Alencar

Problem Frames and i* are two broadly used approaches that require a good background from the requirements engineering. Both approaches have typical traits that fit in equivalent. On the other hand, there are features that do not fit. Thereby, there are some points which need improvements on both of them. This work analyzes the five basic problem frames, defined by Michael Jackson, in the i* co...

2007
Isabelle Côté Denis Hatebur Maritta Heisel Holger Schmidt Ina Wentzlaff

We give an enumeration of possible problem frames, based on domain characteristics, and comment on the usefulness of the obtained frames. In particular, we investigate problem domains and their characteristics in detail. This leads to fine-grained criteria for describing problem domains. As a result, we identify a new type of problem domain and come up with integrity conditions for problem fram...

Journal: :Int. J. Approx. Reasoning 2009
Masahiro Inuiguchi Yukihiro Yoshioka Yoshifumi Kusunoki

In this paper, a variable-precision dominance-based rough set approach (VP-DRSA) is proposed together with several VP-DRSA-based approaches to attribute reduction. The properties of VP-DRSA are shown in comparison to previous dominance-based rough set approaches. An advantage of VP-DRSA over variable-consistency dominance-based rough set approach in decision rule induction is emphasized. Some r...

Journal: :SIAM J. Comput. 1988
Bernard Chazelle

We establish new upper bounds on the complexity of multidimensional 3earching. Our results include, in particular, linear-size data structures for range and rectangle counting in two dimensions with logarithmic query time. More generally, we give improved data structures for rectangle problems in any dimension, in a static as well as a dynamic setting. Several of the algorithms we give are simp...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید