Sciweavers

8009 search results - page 39 / 1602
» cans 2005
Sort
View
CP
2005
Springer
15 years 5 months ago
Acquiring Parameters of Implied Global Constraints
This paper presents a technique for learning parameterized implied constraints. They can be added to a model to improve the solving process. Experiments on implied Gcc constraints ...
Christian Bessière, Remi Coletta, Thierry P...
CSL
2005
Springer
15 years 5 months ago
The Modular Decomposition of Countable Graphs: Constructions in Monadic Second-Order Logic
We show that the modular decomposition of a countable graph can be defined from this graph, given with an enumeration of its set of vertices, by formulas of Monadic Second-Order l...
Bruno Courcelle, Christian Delhommé
ECAL
2005
Springer
15 years 5 months ago
Ant-Based Computing
We propose a biologically and physically plausible model for ants and pheromones, and show this model to be sufficiently powerful to simulate the computation of arbitrary logic cir...
Loizos Michael
ECML
2005
Springer
15 years 5 months ago
Margin-Sparsity Trade-Off for the Set Covering Machine
We propose a new learning algorithm for the set covering machine and a tight data-compression risk bound that the learner can use for choosing the appropriate tradeoff between the ...
François Laviolette, Mario Marchand, Mohak ...
EUROCAST
2005
Springer
92views Hardware» more  EUROCAST 2005»
15 years 5 months ago
Computation of Partial Automata Through Span Composition
In this paper a way to have structures with partiality in its internal structure in a categorical approach is presented and, with this, a category of partial graphs Grp is given an...
Karina Roggia, Marnes Hoff, Paulo Blauth Menezes