Sciweavers

381 search results - page 65 / 77
» On the advantage over a random assignment
Sort
View
CONSTRAINTS
2010
126views more  CONSTRAINTS 2010»
13 years 8 months ago
Lexicographically-ordered constraint satisfaction problems
Abstract. We describe a simple CSP formalism for handling multi-attribute preference problems with hard constraints, one that combines hard constraints and preferences so the two a...
Eugene C. Freuder, Robert Heffernan, Richard J. Wa...
GPEM
2008
128views more  GPEM 2008»
13 years 7 months ago
Coevolutionary bid-based genetic programming for problem decomposition in classification
In this work a cooperative, bid-based, model for problem decomposition is proposed with application to discrete action domains such as classification. This represents a significan...
Peter Lichodzijewski, Malcolm I. Heywood
TPDS
2008
78views more  TPDS 2008»
13 years 7 months ago
Tracing Worm Break-In and Contaminations via Process Coloring: A Provenance-Preserving Approach
To detect and investigate self-propagating worm attacks against networked servers, the following capabilities are desirable: (1) raising timely alerts to trigger a worm investigat...
Xuxian Jiang, Florian P. Buchholz, Aaron Walters, ...
ENTCS
2000
120views more  ENTCS 2000»
13 years 7 months ago
Efficient Substitution in Hoare Logic Expressions
Substitution plays an important role in Hoare Logic, as it is used in interpreting assignments. When writing a computer-based realization of Hoare Logic, it is therefore important...
Roberto Virga
IPM
2002
106views more  IPM 2002»
13 years 7 months ago
A feature mining based approach for the classification of text documents into disjoint classes
This paper proposes a new approach for classifying text documents into two disjoint classes. The new approach is based on extracting patterns, in the form of two logical expressio...
Salvador Nieto Sánchez, Evangelos Triantaph...