Sciweavers

701 search results - page 6 / 141
» Design patterns for lazy evaluation
Sort
View
AIR
2005
119views more  AIR 2005»
13 years 7 months ago
An Assessment of Case-Based Reasoning for Spam Filtering
Because of the changing nature of spam, a spam filtering system that uses machine learning will need to be dynamic. This suggests that a case-based (memory-based) approach may work...
Sarah Jane Delany, Padraig Cunningham, Lorcan Coyl...
ML
2008
ACM
135views Machine Learning» more  ML 2008»
13 years 7 months ago
Compiling pattern matching to good decision trees
We address the issue of compiling ML pattern matching to compact and efficient decisions trees. Traditionally, compilation to decision trees is optimized by (1) implementing decis...
Luc Maranget
WCFLP
2005
ACM
14 years 27 days ago
Lightweight program specialization via dynamic slicing
Program slicing is a well-known technique that extracts from a program those statements which are relevant to a particular criterion. While static slicing does not consider any in...
Claudio Ochoa, Josep Silva, Germán Vidal
FROCOS
2000
Springer
13 years 11 months ago
Compiling Multi-Paradigm Declarative Programs into Prolog
This paper describes a high-level implementation of the concurrent constraint functional logic language Curry. The implementation, directed by the lazy pattern matching strategy of...
Sergio Antoy, Michael Hanus
ECSA
2010
Springer
13 years 8 months ago
Impact Evaluation for Quality-Oriented Architectural Decisions regarding Evolvability
Abstract. Quality goals have to be under a special consideration during software architectural design. Evolvability constitutes a quality goal with a special relevance for business...
Stephan Bode, Matthias Riebisch