Sciweavers

2681 search results - page 402 / 537
» Problem F
Sort
View
115
Voted
DOCENG
2007
ACM
15 years 6 months ago
Speculative document evaluation
Optimisation of real world Variable Data printing (VDP) documents is a difficult problem because the interdependencies between layout functions may drastically reduce the number o...
Alexander J. Macdonald, David F. Brailsford, Steve...
105
Voted
KDD
2010
ACM
282views Data Mining» more  KDD 2010»
15 years 6 months ago
Optimizing debt collections using constrained reinforcement learning
In this paper, we propose and develop a novel approach to the problem of optimally managing the tax, and more generally debt, collections processes at financial institutions. Our...
Naoki Abe, Prem Melville, Cezar Pendus, Chandan K....
GROUP
2007
ACM
15 years 6 months ago
Supporting collaborative software development through the visualization of socio-technical dependencies
One of the reasons large-scale software development is difficult is the number of dependencies that software engineers face. These dependencies create a need for communication and...
Cleidson R. B. de Souza, Stephen Quirk, Erik Train...
ASAP
2004
IEEE
102views Hardware» more  ASAP 2004»
15 years 6 months ago
A Hierarchical Classification Scheme to Derive Interprocess Communication in Process Networks
The Compaan compiler automatically derives a Process Network (PN) description from an application written in Matlab. The basic element of a PN is a Producer/Consumer (P/C) pair. F...
Alexandru Turjan, Bart Kienhuis, Ed F. Deprettere
AUSDM
2006
Springer
94views Data Mining» more  AUSDM 2006»
15 years 6 months ago
Marking Time in Sequence Mining
Sequence mining is often conducted over static and temporal datasets as well as over collections of events (episodes). More recently, there has also been a focus on the mining of ...
Carl Mooney, John F. Roddick