Sciweavers

CP
2006
Springer
15 years 7 months ago
Compiling Finite Linear CSP into SAT
Naoyuki Tamura, Akiko Taga, Satoshi Kitagawa, Muts...
CP
2006
Springer
15 years 7 months ago
Generating Propagators for Finite Set Constraints
Ideally, programming propagators as implementations of constraints should be an entirely declarative specification process for a large class of constraints: a high-level declarativ...
Guido Tack, Christian Schulte, Gert Smolka
FPL
2004
Springer
119views Hardware» more  FPL 2004»
15 years 7 months ago
Reconfigurable Instruction Set Extension for Enabling ECC on an 8-Bit Processor
Pervasive networks with low-cost embedded 8-bit processors are set to change our day-to-day life. Public-key cryptography provides crucial functionality to assure security which is...
Sandeep S. Kumar, Christof Paar
CP
2006
Springer
15 years 7 months ago
A Simple Distribution-Free Approach to the Max k-Armed Bandit Problem
The max k-armed bandit problem is a recently-introduced online optimization problem with practical applications to heuristic search. Given a set of k slot machines, each yielding p...
Matthew J. Streeter, Stephen F. Smith
CP
2006
Springer
15 years 7 months ago
Constraint Programming Models for Graceful Graphs
The problem of finding a graceful labelling of a graph, or proving that the graph is not graceful, has previously been modelled as a CSP. A new and much faster CSP model of the pro...
Barbara M. Smith