Sciweavers

1968 search results - page 296 / 394
» The Complexity of Valued Constraint Models
Sort
View
CASES
2005
ACM
14 years 12 months ago
Optimizing stream programs using linear state space analysis
Digital Signal Processing (DSP) is becoming increasingly widespread in portable devices. Due to harsh constraints on power, latency, and throughput in embedded environments, devel...
Sitij Agrawal, William Thies, Saman P. Amarasinghe
JACM
2000
131views more  JACM 2000»
14 years 9 months ago
The soft heap: an approximate priority queue with optimal error rate
A simple variant of a priority queue, called a soft heap, is introduced. The data structure supports the usual operations: insert, delete, meld, and findmin. Its novelty is to beat...
Bernard Chazelle
COMPLEXITY
2004
165views more  COMPLEXITY 2004»
14 years 9 months ago
Sex promotes gamete selection: A quantitative comparative study of features favoring the evolution of sex
: Explaining the maintenance of sexual reproduction remains one of the greatest challenges in biology. The theoretical oddity of sex is based on at least three advantages that asex...
Klaus Jaffe
ATAL
2004
Springer
15 years 3 months ago
Approximate Solutions for Partially Observable Stochastic Games with Common Payoffs
Partially observable decentralized decision making in robot teams is fundamentally different from decision making in fully observable problems. Team members cannot simply apply si...
Rosemary Emery-Montemerlo, Geoffrey J. Gordon, Jef...
ICDM
2002
IEEE
133views Data Mining» more  ICDM 2002»
15 years 2 months ago
Estimating the number of segments in time series data using permutation tests
Segmentation is a popular technique for discovering structure in time series data. We address the largely open problem of estimating the number of segments that can be reliably di...
Kari Vasko, Hannu Toivonen