Sciweavers

13987 search results - page 154 / 2798
» The Two Guards Problem
Sort
View
127
Voted
CP
2005
Springer
15 years 9 months ago
Caching Search States in Permutation Problems
When the search for a solution to a constraint satisfaction problem backtracks, it is not usually worthwhile to remember the assignment that failed, because the same assignment wil...
Barbara M. Smith
CEC
2009
IEEE
15 years 10 months ago
Tackling high dimensional nonseparable optimization problems by cooperatively coevolving particle swarms
— This paper attempts to address the question of scaling up Particle Swarm Optimization (PSO) algorithms to high dimensional optimization problems. We present a cooperative coevo...
Xiaodong Li, Xin Yao
168
Voted
SOCC
2008
IEEE
124views Education» more  SOCC 2008»
15 years 10 months ago
Energy minimization using a greedy randomized heuristic for the voltage assignment problem in NoC
— Scaling down the voltage levels of the processing elements (PEs) in a Network-on-Chip (NoC) can significantly reduce the computation energy consumption with an overhead of the...
Pavel Ghosh, Arunabha Sen
GFKL
2007
Springer
196views Data Mining» more  GFKL 2007»
15 years 9 months ago
Comparison of Recommender System Algorithms Focusing on the New-item and User-bias Problem
Recommender systems are used by an increasing number of e-commerce websites to help the customers to find suitable products from a large database. One of the most popular techniqu...
Stefan Hauger, Karen H. L. Tso, Lars Schmidt-Thiem...
SAC
2004
ACM
15 years 9 months ago
An improved hybrid genetic algorithm for the generalized assignment problem
We consider the generalized assignment problem in which the objective is to find a minimum cost assignment of a set of jobs to a set of agents subject to resource constraints. Th...
Harald Feltl, Günther R. Raidl