Sciweavers

1964 search results - page 175 / 393
» Partitioning Based Algorithms for Some Colouring Problems
Sort
View
CDC
2009
IEEE
147views Control Systems» more  CDC 2009»
14 years 25 days ago
A simulation-based method for aggregating Markov chains
— This paper addresses model reduction for a Markov chain on a large state space. A simulation-based framework is introduced to perform state aggregation of the Markov chain base...
Kun Deng, Prashant G. Mehta, Sean P. Meyn
SODA
1992
ACM
179views Algorithms» more  SODA 1992»
13 years 9 months ago
Approximating the Minimum Weight Triangulation
We show that the length of the minimum weight Steiner triangulation (MWST) of a point set can be approximated within a constant factor by a triangulation algorithm based on quadtr...
David Eppstein
GECCO
2010
Springer
197views Optimization» more  GECCO 2010»
13 years 11 months ago
Niching the CMA-ES via nearest-better clustering
We investigate how a niching based evolutionary algorithm fares on the BBOB function test set, knowing that most problems are not very well suited to this algorithm class. However...
Mike Preuss
ESA
1998
Springer
108views Algorithms» more  ESA 1998»
14 years 10 days 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
CONSTRAINTS
1998
94views more  CONSTRAINTS 1998»
13 years 7 months ago
Resource Constraints for Preemptive Job-shop Scheduling
This paper presents an experimental study of constraint propagation algorithms for preemptive scheduling. We propose generalizations of non-preemptive constraint propagation techni...
Claude Le Pape, Philippe Baptiste