Sciweavers

1792 search results - page 90 / 359
» e-Participation and Decision Analysis
Sort
View
AGP
1999
IEEE
15 years 10 months ago
Freeness Analysis through Linear Refinement
Domains Decomposing Non-Redundant Sharing by Complementation . . . . . . . . . . . . . 69 Enea Zaffanella, Patricia M. Hill, Roberto Bagnara Freeness Analysis Through Linear Refine...
Patricia M. Hill, Fausto Spoto
ESOP
1998
Springer
15 years 10 months ago
A Polyvariant Binding-Time Analysis for Off-line Partial Deduction
Abstract. We study the notion of binding-time analysis for logic programs. We formalise the unfolding aspect of an on-line partial deduction s a Prolog program. Using abstract inte...
Maurice Bruynooghe, Michael Leuschel, Konstantinos...
FMOODS
2007
15 years 7 months ago
On Formal Analysis of OO Languages Using Rewriting Logic: Designing for Performance
Rewriting logic provides a powerful, flexible mechanism for language definition and analysis. This flexibility in design can lead to problems during analysis, as different desi...
Mark Hills, Grigore Rosu
DSS
2008
116views more  DSS 2008»
15 years 6 months ago
GRAnD: A goal-oriented approach to requirement analysis in data warehouses
Several surveys indicate that a significant percentage of data warehouses fail to meet business objectives or are outright failures. One of the reasons for this is that requiremen...
Paolo Giorgini, Stefano Rizzi, Maddalena Garzetti
GECCO
2006
Springer
447views Optimization» more  GECCO 2006»
15 years 10 months ago
Candlestick stock analysis with genetic algorithms
Candlestick analysis, a form of stock market technical analysis, is well suited for use with a genetic search algorithm. This paper explores an implementation of marrying these tw...
Peter Belford