Sciweavers

5214 search results - page 287 / 1043
» The Online Specialization Problem
Sort
View
CP
2004
Springer
16 years 3 days ago
Backtrack-Free Search for Real-Time Constraint Satisfaction
A constraint satisfaction problem (CSP) model can be preprocessed to ensure that any choices made will lead to solutions, without the need to backtrack. This can be especially usef...
J. Christopher Beck, Tom Carchrae, Eugene C. Freud...
KDD
2009
ACM
165views Data Mining» more  KDD 2009»
15 years 11 months ago
Pricing guidance in ad sale negotiations: the PrintAds example
We consider negotiations between publishers and advertisers in a marketplace for ads. Motivated by Google’s online PrintAds system which is such a marketplace, we focus on the r...
Adam Isaac Juda, S. Muthukrishnan, Ashish Rastogi
173
Voted
ICPR
2010
IEEE
15 years 9 months ago
A Bi-Modal Handwritten Text Corpus: Baseline Results
Handwritten text is generally captured through two main modalities: off-line and on-line. Smart approaches to handwritten text recognition (HTR) may take advantage of both modalit...
Moises Pastor, Alejandro Héctor Toselli, Francisc...
AAAI
2007
15 years 9 months ago
Learning to Solve QBF
We present a novel approach to solving Quantified Boolean Formulas (QBF) that combines a search-based QBF solver with machine learning techniques. We show how classification met...
Horst Samulowitz, Roland Memisevic
SODA
1994
ACM
88views Algorithms» more  SODA 1994»
15 years 8 months ago
Optimal Prediction for Prefetching in the Worst Case
Response time delays caused by I/O are a major problem in many systems and database applications. Prefetching and cache replacement methods are attracting renewed attention because...
P. Krishnan, Jeffrey Scott Vitter