Results 1  10
of
45,791
On a CliqueBased Integer Programming Formulation of Vertex Colouring with Applications in Course Timetabling
, 2007
"... Vertex colouring is a wellknown problem in combinatorial optimisation, whose alternative integer programming formulations have recently attracted considerable attention. This paper briefly surveys seven known formulations of vertex colouring and introduces a new formulation of vertex colouring usi ..."
Abstract

Cited by 9 (5 self)
 Add to MetaCart
Vertex colouring is a wellknown problem in combinatorial optimisation, whose alternative integer programming formulations have recently attracted considerable attention. This paper briefly surveys seven known formulations of vertex colouring and introduces a new formulation of vertex colouring us
A cliquebased algorithm for constructing feasible timetables
, 2010
"... Publication details, including instructions for authors and subscription information: ..."
Abstract
 Add to MetaCart
Publication details, including instructions for authors and subscription information:
A cliquebased algorithm for constructing feasible timetables
"... Constructing a feasible solution, where the focus is on “hard ” constraints only, is an important part of solving timetabling problems. For the University Course Timetabling Problem (UCTP), we propose a heuristic algorithm to schedule events to timeslots based on cliques, each representing a set of ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Constructing a feasible solution, where the focus is on “hard ” constraints only, is an important part of solving timetabling problems. For the University Course Timetabling Problem (UCTP), we propose a heuristic algorithm to schedule events to timeslots based on cliques, each representing a set
A supernodal formulation of vertex colouring with applications in course timetabling
, 2009
"... For many problems in Scheduling and Timetabling the choice of an mathematical programming formulation is determined by the formulation of the graph colouring component. This paper briefly surveys seven known integer programming formulations of vertex colouring and introduces a new formulation using ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
For many problems in Scheduling and Timetabling the choice of an mathematical programming formulation is determined by the formulation of the graph colouring component. This paper briefly surveys seven known integer programming formulations of vertex colouring and introduces a new formulation using
Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
 SIAM Journal on Optimization
, 1993
"... We study the semidefinite programming problem (SDP), i.e the problem of optimization of a linear function of a symmetric matrix subject to linear equality constraints and the additional condition that the matrix be positive semidefinite. First we review the classical cone duality as specialized to S ..."
Abstract

Cited by 557 (12 self)
 Add to MetaCart
mechanical way to algorithms for SDP with proofs of convergence and polynomial time complexity also carrying over in a similar fashion. Finally we study the significance of these results in a variety of combinatorial optimization problems including the general 01 integer programs, the maximum clique
Usability Analysis of Visual Programming Environments: a `cognitive dimensions' framework
 JOURNAL OF VISUAL LANGUAGES AND COMPUTING
, 1996
"... The cognitive dimensions framework is a broadbrush evaluation technique for interactive devices and for noninteractive notations. It sets out a small vocabulary of terms designed to capture the cognitivelyrelevant aspects of structure, and shows how they can be traded off against each other. T ..."
Abstract

Cited by 510 (13 self)
 Add to MetaCart
. The purpose of this paper is to propose the framework as an evaluation technique for visual programming environments. We apply it to two commerciallyavailable dataflow languages (with further examples from other systems) and conclude that it is effective and insightful; other HCIbased evaluation
CliqueBased Crossover For Solving the Timetabling Problem with GAs
 Proceedings of the Congress on Evolutionary Computation
, 1999
"... This article describes an investigation and its results on a new crossover operator for solving the Timetabling Problem with Genetic Algorithms. Since a Timetabling Problem can be represented as a graph, and then manipulated as a GraphColouring Problem, the central feature behind the approach prese ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
This article describes an investigation and its results on a new crossover operator for solving the Timetabling Problem with Genetic Algorithms. Since a Timetabling Problem can be represented as a graph, and then manipulated as a GraphColouring Problem, the central feature behind the approach
Constraint Networks
, 1992
"... Constraintbased reasoning is a paradigm for formulating knowledge as a set of constraints without specifying the method by which these constraints are to be satisfied. A variety of techniques have been developed for finding partial or complete solutions for different kinds of constraint expression ..."
Abstract

Cited by 1149 (43 self)
 Add to MetaCart
Constraintbased reasoning is a paradigm for formulating knowledge as a set of constraints without specifying the method by which these constraints are to be satisfied. A variety of techniques have been developed for finding partial or complete solutions for different kinds of constraint
Graphical models, exponential families, and variational inference
, 2008
"... The formalism of probabilistic graphical models provides a unifying framework for capturing complex dependencies among random variables, and building largescale multivariate statistical models. Graphical models have become a focus of research in many statistical, computational and mathematical fiel ..."
Abstract

Cited by 800 (26 self)
 Add to MetaCart
likelihoods, marginal probabilities and most probable configurations. We describe how a wide varietyof algorithms — among them sumproduct, cluster variational methods, expectationpropagation, mean field methods, maxproduct and linear programming relaxation, as well as conic programming relaxations — can
Property Testing and its connection to Learning and Approximation
"... We study the question of determining whether an unknown function has a particular property or is fflfar from any function with that property. A property testing algorithm is given a sample of the value of the function on instances drawn according to some distribution, and possibly may query the fun ..."
Abstract

Cited by 498 (68 self)
 Add to MetaCart
the function on instances of its choice. First, we establish some connections between property testing and problems in learning theory. Next, we focus on testing graph properties, and devise algorithms to test whether a graph has properties such as being kcolorable or having a aeclique (clique of density ae
Results 1  10
of
45,791