Sciweavers

2354 search results - page 236 / 471
» Assignment Problems
Sort
View
AAAI
1994
15 years 7 months ago
Noise Strategies for Improving Local Search
It has recently been shown that local search is surprisingly good at nding satisfying assignments for certain computationally hard classes of CNF formulas. The performance of basi...
Bart Selman, Henry A. Kautz, Bram Cohen
AMW
2009
15 years 7 months ago
T3: On Mapping Text To Time Series
We investigate if the mapping between text and time series data is feasible such that relevant data mining problems in text can find their counterparts in time series (and vice ver...
Tao Yang, Dongwon Lee
ESA
2010
Springer
140views Algorithms» more  ESA 2010»
15 years 6 months ago
A Robust PTAS for Machine Covering and Packing
Abstract. Minimizing the makespan or maximizing the minimum machine load are two of the most important and fundamental parallel machine scheduling problems. In an online scenario, ...
Martin Skutella, José Verschae
DAM
2008
109views more  DAM 2008»
15 years 6 months ago
Minimal comparability completions of arbitrary graphs
A transitive orientation of an undirected graph is an assignment of directions to its edges so that these directed edges represent a transitive relation between the vertices of th...
Pinar Heggernes, Federico Mancini, Charis Papadopo...
ML
2008
ACM
15 years 6 months ago
Layered critical values: a powerful direct-adjustment approach to discovering significant patterns
Standard pattern discovery techniques, such as association rules, suffer an extreme risk of finding very large numbers of spurious patterns for many knowledge discovery tasks. The...
Geoffrey I. Webb