Sciweavers

2398 search results - page 364 / 480
» Constraint Programming and Graph Algorithms
Sort
View
ESA
1998
Springer
108views Algorithms» more  ESA 1998»
15 years 9 months ago
Finding an Optimal Path without Growing the Tree
In this paper, we study a class of optimal path problems with the following phenomenon: The space complexity of the algorithms for reporting the lengths of single-source optimal pa...
Danny Z. Chen, Ovidiu Daescu, Xiaobo Hu, Jinhui Xu
CSR
2009
Springer
15 years 11 months ago
Variations on Muchnik's Conditional Complexity Theorem
Muchnik’s theorem about simple conditional descriptions states that for all strings a and b there exists a short program p transforming a to b that has the least possible length ...
Daniil Musatov, Andrei E. Romashchenko, Alexander ...
SOCO
2009
Springer
15 years 11 months ago
Lazy Composition of Representations in Java
Abstract. The separation of concerns has been a core idiom of software engineering for decades. In general, software can be decomposed properly only according to a single concern, ...
Rémi Douence, Xavier Lorca, Nicolas Loriant
GECCO
2007
Springer
155views Optimization» more  GECCO 2007»
15 years 11 months ago
Towards clustering with XCS
This paper presents a novel approach to clustering using an accuracy-based Learning Classifier System. Our approach achieves this by exploiting the generalization mechanisms inher...
Kreangsak Tamee, Larry Bull, Ouen Pinngern
GECCO
2007
Springer
210views Optimization» more  GECCO 2007»
15 years 11 months 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