Sciweavers

1945 search results - page 185 / 389
» Speeding up Serpent
Sort
View
COR
2006
98views more  COR 2006»
15 years 6 months ago
Exploiting semidefinite relaxations in constraint programming
Constraint programming uses enumeration and search tree pruning to solve combinatorial optimization problems. In order to speed up this solution process, we investigate the use of...
Willem Jan van Hoeve
ESWA
2006
182views more  ESWA 2006»
15 years 6 months ago
Improved route planning and scheduling of waste collection and transport
The collection of waste is a highly visible and important municipal service that involves large expenditures. Waste collection problems are, however, one of the most difficult ope...
Teemu Nuortio, Jari Kytöjoki, Harri Niska, Ol...
FGCS
2006
82views more  FGCS 2006»
15 years 6 months ago
PGGA: A predictable and grouped genetic algorithm for job scheduling
This paper presents a predictable and grouped genetic algorithm (PGGA) for job scheduling. The novelty of the PGGA is twofold: (1) a job workload estimati...
Maozhen Li, Bin Yu, Man Qi
COMPUTING
2007
103views more  COMPUTING 2007»
15 years 6 months ago
An algebraic approach for H-matrix preconditioners
Hierarchical matrices (H-matrices) approximate matrices in a data-sparse way, and the approximate arithmetic for H-matrices is almost optimal. In this paper we present an algebrai...
S. Oliveira, F. Yang
COMSIS
2007
167views more  COMSIS 2007»
15 years 6 months ago
Developing a New Color Model for Image Analysis and Processing
The theoretical outcomes and experimental results of new color model implemented in algorithms and software of image processing are presented in the paper. This model, as it will b...
Rashad J. Rasras, Ibrahiem M. M. El Emary, Dimitri...