Sciweavers

4743 search results - page 855 / 949
» The PlusCal Algorithm Language
Sort
View
CP
2009
Springer
14 years 9 months ago
The Complexity of Valued Constraint Models
The Valued Constraint Satisfaction Problem (VCSP) is a general framework encompassing many optimisation problems. We discuss precisely what it means for a problem to be modelled in...
Peter G. Jeavons, Stanislav Zivný
CP
2009
Springer
14 years 9 months ago
Constraint-Based Optimal Testing Using DNNF Graphs
The goal of testing is to distinguish between a number of hypotheses about a systemfor example, dierent diagnoses of faults by applying input patterns and verifying or falsifying t...
Anika Schumann, Martin Sachenbacher, Jinbo Huang
CP
2009
Springer
14 years 9 months ago
Minimising Decision Tree Size as Combinatorial Optimisation
Decision tree induction techniques attempt to find small trees that fit a training set of data. This preference for smaller trees, which provides a learning bias, is often justifie...
Christian Bessiere, Emmanuel Hebrard, Barry O'Sull...
SIGCSE
2009
ACM
130views Education» more  SIGCSE 2009»
14 years 9 months ago
Introducing PyLighter: dynamic code highlighter
Like a screenplay, a program is both a static artifact and instructions for a dynamic performance. This duality can keep laypeople from appreciating the complexity of software sys...
Michael G. Boland, Curtis C. Cliburn
KDD
2003
ACM
146views Data Mining» more  KDD 2003»
14 years 9 months ago
Style mining of electronic messages for multiple authorship discrimination: first results
This paper considers the use of computational stylistics for performing authorship attribution of electronic messages, addressing categorization problems with as many as 20 differ...
Shlomo Argamon, Marin Saric, Sterling Stuart Stein