Sciweavers

697 search results - page 86 / 140
» A Study of Evaluation Functions for the Graph K-Coloring Pro...
Sort
View
CSCLP
2004
Springer
14 years 1 months ago
Automatically Exploiting Symmetries in Constraint Programming
We introduce a framework for studying and solving a class of CSP formulations. The framework allows constraints to be expressed as linear and nonlinear equations, then compiles th...
Arathi Ramani, Igor L. Markov
ICDT
2005
ACM
125views Database» more  ICDT 2005»
14 years 1 months ago
PTIME Queries Revisited
The existence of a language expressing precisely the PTIME queries on arbitrary structures remains the central open problem in the theory of database query languages. As it turns o...
Alan Nash, Jeffrey B. Remmel, Victor Vianu
APLAS
2010
ACM
13 years 8 months ago
Amortized Resource Analysis with Polymorphic Recursion and Partial Big-Step Operational Semantics
This paper studies the problem of statically determining upper bounds on the resource consumption of first-order functional programs. A previous work approached the problem with an...
Jan Hoffmann 0002, Martin Hofmann
PLDI
2004
ACM
14 years 1 months ago
Symbolic pointer analysis revisited
Pointer analysis is a critical problem in optimizing compiler, parallelizing compiler, software engineering and most recently, hardware synthesis. While recent efforts have sugges...
Jianwen Zhu, Silvian Calman
ICML
2009
IEEE
14 years 8 months ago
Bayesian clustering for email campaign detection
We discuss the problem of clustering elements according to the sources that have generated them. For elements that are characterized by independent binary attributes, a closedform...
Peter Haider, Tobias Scheffer