Sciweavers

5 search results - page 1 / 1
» A combinatorial approach to jumping particles: The parallel ...
Sort
View
RSA
2008
87views more  RSA 2008»
13 years 4 months ago
A combinatorial approach to jumping particles: The parallel TASEP
In this paper we continue the combinatorial study of models of particles jumping on a row of cells which we initiated with the standard totally asymmetric exclusion process or TASE...
Enrica Duchi, Gilles Schaeffer
ICNC
2009
Springer
13 years 9 months ago
Vehicle Routing Problem with Time Windows: A Hybrid Particle Swarm Optimization Approach
Vehicle routing problem (VRP) is a well-known combinatorial optimization and nonlinear programming problem seeking to service a number of customers with a fleet of vehicles. This ...
Xiaoxiang Liu, Weigang Jiang, Jianwen Xie
IPPS
2008
IEEE
13 years 11 months ago
Towards a decentralized architecture for optimization
We introduce a generic framework for the distributed execution of combinatorial optimization tasks. Instead of relying on custom hardware (like dedicated parallel machines or clus...
Marco Biazzini, Mauro Brunato, Alberto Montresor
CEC
2010
IEEE
13 years 3 months ago
A binary Particle Swarm Optimization approach to fault diagnosis in parallel and distributed systems
— The efficient diagnosis of hardware and software faults in parallel and distributed systems remains a challenge in today’s most prolific decentralized environments. System-...
Rafael Falcón, Marcio Almeida, Amiya Nayak
ICANNGA
2007
Springer
100views Algorithms» more  ICANNGA 2007»
13 years 8 months ago
Softening Splits in Decision Trees Using Simulated Annealing
Predictions computed by a classification tree are usually constant on axis-parallel hyperrectangles corresponding to the leaves and have strict jumps on their boundaries. The densi...
Jakub Dvorák, Petr Savický