Sciweavers

13987 search results - page 382 / 2798
» The Two Guards Problem
Sort
View
KDD
2009
ACM
216views Data Mining» more  KDD 2009»
16 years 7 months ago
Finding a team of experts in social networks
Given a task T , a pool of individuals X with different skills, and a social network G that captures the compatibility among these individuals, we study the problem of finding X ,...
Theodoros Lappas, Kun Liu, Evimaria Terzi
OOPSLA
2009
Springer
16 years 1 months ago
CZ: multiple inheritance without diamonds
Multiple inheritance has long been plagued with the “diamond” inheritance problem, leading to solutions that restrict expressiveness, such as mixins and traits. Instead, we ad...
Donna Malayeri, Jonathan Aldrich
CEC
2007
IEEE
16 years 1 months ago
Modified genetic algorithm for job-shop scheduling: A gap utilization technique
—The Job-Shop Scheduling Problem (JSSP) is one of the most critical combinatorial optimization problems. The objective of JSSP in this research is to minimize the makespan. In th...
S. M. Kamrul Hasan, Ruhul A. Sarker, David Cornfor...
CEC
2007
IEEE
16 years 1 months ago
Light beam search based multi-objective optimization using evolutionary algorithms
Abstract— For the past decade or so, evolutionary multiobjective optimization (EMO) methodologies have earned wide popularity for solving complex practical optimization problems,...
Kalyanmoy Deb, Abhay Kumar
ICIP
2007
IEEE
16 years 1 months ago
A Novel Kernel Discriminant Analysis for Face Verification
In this paper a novel non-linear subspace method for face verification is proposed. The problem of face verification is considered as a two-class problem (genuine versus imposto...
Georgios Goudelis, Stefanos Zafeiriou, Anastasios ...