Sciweavers

278 search results - page 27 / 56
» Algorithmic randomness and monotone complexity on product sp...
Sort
View
SDM
2007
SIAM
171views Data Mining» more  SDM 2007»
13 years 10 months ago
A Better Alternative to Piecewise Linear Time Series Segmentation
Time series are difficult to monitor, summarize and predict. Segmentation organizes time series into few intervals having uniform characteristics (flatness, linearity, modality,...
Daniel Lemire
GECCO
2004
Springer
120views Optimization» more  GECCO 2004»
14 years 1 months ago
Comparison of Selection Strategies for Evolutionary Quantum Circuit Design
Evolution of quantum circuits faces two major challenges: complex and huge search spaces and the high costs of simulating quantum circuits on conventional computers. In this paper ...
André Leier, Wolfgang Banzhaf
HIS
2008
13 years 10 months ago
Hybrid Approach for Machine Scheduling Optimization in Custom Furniture Industry
Machine scheduling is a critical problem in industries where products are custom-designed. The wide range of products, the lack of previous experiences in manufacturing, and the s...
Juan Carlos Vidal, Manuel Mucientes, Alberto Bugar...
ICALP
1994
Springer
14 years 17 days ago
On the Cost of Recomputing: Tight Bounds on Pebbling with Faults
We introduce a formal framework to study the time and space complexity of computing with faulty memory. For the fault-free case, time and space complexities were studied using the...
Yonatan Aumann, Judit Bar-Ilan, Uriel Feige
CORR
1998
Springer
84views Education» more  CORR 1998»
13 years 8 months ago
A Variant of Earley Parsing
The Earley algorithm is a widely used parsing method in natural language processing applications. We introduce a variant of Earley parsing that is based on a “delayed” recognit...
Mark-Jan Nederhof, Giorgio Satta