Sciweavers

146 search results - page 15 / 30
» Computably Enumerable Sets and Quasi-Reducibility
Sort
View
CIE
2007
Springer
14 years 5 months ago
Computational Complexity of Constraint Satisfaction
Abstract. The input to a constraint satisfaction problem (CSP) consists of a set of variables, each with a domain, and constraints between these variables formulated by relations o...
Heribert Vollmer
ICSM
2008
IEEE
14 years 5 months ago
Automatically identifying C++0x concepts in function templates
An automated approach to the identification of C++0x concepts in function templates is described. Concepts are part of a new language feature appearing in the next standard for C+...
Andrew Sutton, Jonathan I. Maletic
ESCIENCE
2006
IEEE
14 years 5 months ago
Application-Level Resource Provisioning on the Grid
In this paper, we present algorithms for Grid resource provisioning that employ agreement-based resource management. These algorithms allow userlevel resource allocation and sched...
Gurmeet Singh, Carl Kesselman, Ewa Deelman
AISC
2004
Springer
14 years 4 months ago
Solving Equations Involving Sequence Variables and Sequence Functions
Term equations involving individual and sequence variables and sequence function symbols are studied. Function symbols can have either fixed or flexible arity. A sequence variabl...
Temur Kutsia
ANOR
2008
93views more  ANOR 2008»
13 years 11 months ago
Pruning in column generation for service vehicle dispatching
Abstract Column generation techniques have become a widely used technique to successfully solve large (integer) linear programs. One of the keys to obtaining a practically efficien...
Stephan Westphal, Sven Oliver Krumke