Sciweavers

3571 search results - page 380 / 715
» Cohen and Set Theory
Sort
View
COCO
2007
Springer
106views Algorithms» more  COCO 2007»
16 years 28 days ago
The Complexity of Polynomials and Their Coefficient Functions
We study the link between the complexity of a polynomial and that of its coefficient functions. Valiant’s theory is a good setting for this, and we start by generalizing one of V...
Guillaume Malod
COLT
2007
Springer
16 years 28 days ago
Occam's Hammer
Abstract. We establish a generic theoretical tool to construct probabilistic bounds for algorithms where the output is a subset of objects from an initial pool of candidates (or mo...
Gilles Blanchard, François Fleuret
CP
2007
Springer
16 years 28 days ago
Propagation = Lazy Clause Generation
Finite domain propagation solvers effectively represent the possible values of variables by a set of choices which can be naturally modelled as Boolean variables. In this paper we...
Olga Ohrimenko, Peter J. Stuckey, Michael Codish
GECCO
2007
Springer
210views Optimization» more  GECCO 2007»
16 years 28 days ago
Mining breast cancer data with XCS
In this paper, we describe the use of a modern learning classifier system to a data mining task. In particular, in collaboration with a medical specialist, we apply XCS to a prima...
Faten Kharbat, Larry Bull, Mohammed Odeh
166
Voted
ICWE
2007
Springer
16 years 28 days ago
Structural Patterns for Descriptive Documents
Combining expressiveness and plainness in the design of web documents is a difficult task. Validation languages are very powerful and designers are tempted to over-design specific...
Antonina Dattolo, Angelo Di Iorio, Silvia Duca, An...