Sciweavers

5592 search results - page 358 / 1119
» On Random Betweenness Constraints
Sort
View
CP
2007
Springer
16 years 25 days ago
Solution Directed Backjumping for QCSP
In this paper we present new techniques for improving backtracking based Quantified Constraint Satisfaction Problem (QCSP) solvers. QCSP is a generalization of CSP in which variab...
Fahiem Bacchus, Kostas Stergiou
ICDM
2003
IEEE
240views Data Mining» more  ICDM 2003»
15 years 12 months ago
Clustering of Time Series Subsequences is Meaningless: Implications for Previous and Future Research
Given the recent explosion of interest in streaming data and online algorithms, clustering of time series subsequences, extracted via a sliding window, has received much attention...
Eamonn J. Keogh, Jessica Lin, Wagner Truppel
CDC
2009
IEEE
117views Control Systems» more  CDC 2009»
15 years 11 months ago
Information dissemination in networks via linear iterative strategies over finite fields
— Given an arbitrary network of interconnected nodes, each with an initial value from a discrete set, we consider the problem of distributively disseminating these initial values...
Shreyas Sundaram, Christoforos N. Hadjicostis
AI
1998
Springer
15 years 11 months ago
A Heuristic Incremental Modeling Approach to Course Timetabling
Abstract. The general timetabling problem is an assignment of activities to xed time intervals, adhering to a prede ned set of resource availabilities. Timetabling problems are di ...
Don Banks, Peter van Beek, Amnon Meisels
AUSAI
2007
Springer
15 years 10 months ago
Branching Rules for Satisfiability Analysed with Factor Analysis
Factor analysis is a statistical technique for reducing the number of factors responsible for a matrix of correlations to a smaller number of factors that may reflect underlying va...
Richard J. Wallace, Stuart Bain