Sciweavers

3367 search results - page 215 / 674
» Incremental assignment problem
Sort
View
120
Voted
CP
1995
Springer
15 years 7 months ago
Partial Constraint Satisfaction
We present a method for finding optimal partial solutions to overconstrained instances of the Disjunctive Temporal Problems (DTP). The solutions are optimal in that they satisfy ...
Eugene C. Freuder, Richard J. Wallace
148
Voted
EDBT
2009
ACM
166views Database» more  EDBT 2009»
15 years 8 months ago
Neighbor-based pattern detection for windows over streaming data
The discovery of complex patterns such as clusters, outliers, and associations from huge volumes of streaming data has been recognized as critical for many domains. However, patte...
Di Yang, Elke A. Rundensteiner, Matthew O. Ward
128
Voted
COR
2010
123views more  COR 2010»
15 years 3 months ago
Decomposition, reformulation, and diving in university course timetabling
In many real-life optimisation problems, there are multiple interacting components in a solution. For example, different components might specify assignments to different kinds of...
Edmund K. Burke, Jakub Marecek, Andrew J. Parkes, ...
130
Voted
ESA
2009
Springer
115views Algorithms» more  ESA 2009»
15 years 10 months ago
Output-Sensitive Algorithms for Enumerating Minimal Transversals for Some Geometric Hypergraphs
We give a general framework for the problem of finding all minimal hitting sets of a family of objects in Rd by another. We apply this framework to the following problems: (i) hit...
Khaled M. Elbassioni, Kazuhisa Makino, Imran Rauf
185
Voted

Publication
252views
15 years 6 months ago
Context models on sequences of covers
We present a class of models that, via a simple construction, enables exact, incremental, non-parametric, polynomial-time, Bayesian inference of conditional measures. The approac...
Christos Dimitrakakis