Sciweavers

405 search results - page 47 / 81
» Using critical sets to solve the maximum independent set pro...
Sort
View
DAM
2008
115views more  DAM 2008»
13 years 7 months ago
Variable space search for graph coloring
Let G = (V, E) be a graph with vertex set V and edge set E. The k-coloring problem is to assign a color (a number chosen in {1, . . . , k}) to each vertex of G so that no edge has...
Alain Hertz, Matthieu Plumettaz, Nicolas Zufferey
HIS
2004
13 years 9 months ago
A Case-Based Recommender for Task Assignment in Heterogeneous Computing Systems
Case-based reasoning (CBR) is a knowledge-based problem-solving technique, which is based on reuse of previous experiences. In this paper we propose a new model for static task as...
S. Ghanbari, Mohammad Reza Meybodi, Kambiz Badie
CORR
2011
Springer
215views Education» more  CORR 2011»
12 years 11 months ago
Lasserre Hierarchy, Higher Eigenvalues, and Approximation Schemes for Quadratic Integer Programming with PSD Objectives
We present an approximation scheme for optimizing certain Quadratic Integer Programming problems with positive semidefinite objective functions and global linear constraints. Thi...
Venkatesan Guruswami, Ali Kemal Sinop
ICTAI
2007
IEEE
14 years 1 months ago
Knowledge Based Mechanisms for Tutoring Systems in Science and Engineering
In science and engineering courses, students are often presented a situation for which they are asked to identify the relevant principles and to instantiate them as a set of equat...
Chun Wai Liew, Joel A. Shapiro, Donald E. Smith
GECCO
2008
Springer
141views Optimization» more  GECCO 2008»
13 years 8 months ago
Potential fitness for genetic programming
We introduce potential fitness, a variant of fitness function that operates in the space of schemata and is applicable to tree-based genetic programing. The proposed evaluation ...
Krzysztof Krawiec, PrzemysBaw Polewski