Sciweavers

10907 search results - page 41 / 2182
» Constraint Based Strategies
Sort
View
84
Voted
CP
2004
Springer
15 years 3 months ago
Decomposition and Learning for a Hard Real Time Task Allocation Problem
Abstract. We present a cooperation technique using an accurate management of nogoods to solve a hard real-time problem which consists in assigning periodic tasks to processors in t...
Hadrien Cambazard, Pierre-Emmanuel Hladik, Anne-Ma...
SAINT
2003
IEEE
15 years 3 months ago
Adapted Content Delivery for Different Contexts
In this paper, we present a framework which allows adapted content delivery for different target contexts. This framework is based on a Universal Profiling Schema UPS for describi...
Tayeb Lemlouma, Nabil Layaïda
DMDW
2001
91views Management» more  DMDW 2001»
14 years 11 months ago
On Estimating the Cardinality of Aggregate Views
Accurately estimating the cardinality of aggregate views is crucial for logical and physical design of data warehouses. While the warehouse is under development and data are not a...
Paolo Ciaccia, Matteo Golfarelli, Stefano Rizzi
NAACL
1994
14 years 11 months ago
Phonological Parsing for Bi-directional Letter-to-Sound/Sound-to-Letter Generation
In this paper, we describe a reversibleletter-to-sound/soundto-letter generation system based on an approach which combines a rule-based formalism with data-driven techniques. We ...
Helen M. Meng, Stephanie Seneff, Victor Zue
JAIR
2000
94views more  JAIR 2000»
14 years 9 months ago
Planning Graph as a (Dynamic) CSP: Exploiting EBL, DDB and other CSP Search Techniques in Graphplan
This paper reviews the connections between Graphplan's planning-graph and the dynamic constraint satisfaction problem and motivates the need for adapting CSP search technique...
Subbarao Kambhampati