Sciweavers

138 search results - page 17 / 28
» Combinatorial Optimization Based Recommender Systems
Sort
View
TPDS
1998
124views more  TPDS 1998»
13 years 7 months ago
Using Recorded Values for Bounding the Minimum Completion Time in Multiprocessors
—The way the processes in a parallel program are scheduled on the processors of a multiprocessor system affects the performance significantly. Finding a schedule of processes to ...
Lars Lundberg, Håkan Lennerstad
ICDM
2007
IEEE
147views Data Mining» more  ICDM 2007»
14 years 1 months ago
Scalable Collaborative Filtering with Jointly Derived Neighborhood Interpolation Weights
Recommender systems based on collaborative filtering predict user preferences for products or services by learning past user-item relationships. A predominant approach to collabo...
Robert M. Bell, Yehuda Koren
INFORMATICALT
2010
101views more  INFORMATICALT 2010»
13 years 5 months ago
An Improved Differential Evolution Scheme for the Solution of Large-Scale Unit Commitment Problems
This paper presents an improved differential evolution (IDE) method for the solution of large-scale unit commitment (UC) problems. The objective of the proposed scheme is to determ...
Chen-Sung Chang
ESCIENCE
2006
IEEE
14 years 1 months ago
An Extended Extremal Optimisation Model for Parallel Architectures
: A relatively new meta-heuristic, known as extremal optimisation (EO), is based on the evolutionary science notion that poorly performing genes of an individual are replaced by ra...
Marcus Randall, Andrew Lewis
DATESO
2010
150views Database» more  DATESO 2010»
13 years 5 months ago
Evolving Quasigroups by Genetic Algorithms
Abstract. Quasigroups are a well-known combinatorial design equivalent to more familiar Latin squares. Because all possible elements of a quasigroup occur with equal probability, i...
Václav Snásel, Jiri Dvorský, ...