Sciweavers

3616 search results - page 284 / 724
» Conditional Memory Ordering
Sort
View
CORR
2006
Springer
91views Education» more  CORR 2006»
15 years 4 months ago
Quasi-friendly sup-interpretations
In a previous paper [16], the sup-interpretation method was proposed as a new tool to control memory resources of first order functional programs with pattern matching by static an...
Jean-Yves Marion, Romain Péchoux
CP
2009
Springer
15 years 2 months ago
Minimizing the Maximum Number of Open Stacks by Customer Search
We describe a new exact solver for the minimization of open stacks problem (MOSP). By combining nogood recording with a branch and bound strategy based on choosing which customer s...
Geoffrey Chu, Peter J. Stuckey
TSP
2010
14 years 11 months ago
Distributed estimation of channel gains in wireless sensor networks
We consider the problem of distributed channel estimation in a sensor network which employs a random sleep strategy to conserve energy. If the N network nodes are randomly placed a...
Sivagnanasundaram Ramanan, John MacLaren Walsh
ICDE
2008
IEEE
141views Database» more  ICDE 2008»
16 years 6 months ago
A General Framework for Fast Co-clustering on Large Datasets Using Matrix Decomposition
Abstract-- Simultaneously clustering columns and rows (coclustering) of large data matrix is an important problem with wide applications, such as document mining, microarray analys...
Feng Pan, Xiang Zhang, Wei Wang 0010
ICDE
2002
IEEE
126views Database» more  ICDE 2002»
16 years 6 months ago
Sequenced Subset Operators: Definition and Implementation
Difference, intersection, semi-join and anti-semi-join may be considered binary subset operators, in that they all return a subset of their left-hand argument. These operators are...
Joseph Dunn, Sean Davey, Anne Descour, Richard T. ...