Sciweavers

1805 search results - page 24 / 361
» Functional programming with structured graphs
Sort
View
JMLR
2012
11 years 10 months ago
Structured Output Learning with High Order Loss Functions
Often when modeling structured domains, it is desirable to leverage information that is not naturally expressed as simply a label. Examples include knowledge about the evaluation ...
Daniel Tarlow, Richard S. Zemel
AE
2007
Springer
14 years 1 months ago
A Study of Evaluation Functions for the Graph K-Coloring Problem
The evaluation or fitness function is a key component of any heuristic search algorithm. This paper introduces a new evaluation function for the well-known graph K-coloring proble...
Daniel Cosmin Porumbel, Jin-Kao Hao, Pascale Kuntz
IPPS
2007
IEEE
14 years 1 months ago
iC2mpi: A Platform for Parallel Execution of Graph-Structured Iterative Computations
Parallelization of sequential programs is often daunting because of the substantial development cost involved. Various solutions have been proposed to address this concern, includ...
Harnish Botadra, Qiong Cheng, Sushil K. Prasad, Er...
DAM
2006
172views more  DAM 2006»
13 years 7 months ago
A Branch-and-Cut algorithm for graph coloring
In a previous work, we proposed a new integer programming formulation for the graph coloring problem which, to a certain extent, avoids symmetry. We studied the facet structure of...
Isabel Méndez-Díaz, Paula Zabala
JUCS
2008
165views more  JUCS 2008»
13 years 7 months ago
Shortcut Fusion of Monadic Programs
: Functional programs often combine separate parts of the program using intermediate data structures for communicating results. Programs so defined are easier to understand and mai...
Cecilia Manzino, Alberto Pardo