Sciweavers

1921 search results - page 256 / 385
» Making AC-3 an Optimal Algorithm
Sort
View
131
Voted
DAC
2003
ACM
16 years 3 months ago
Design techniques for sensor appliances: foundations and light compass case study
We propose the first systematic, sensor-centric approach for quantitative design of sensor network appliances. We demonstrate its use by designing light appliance devices and the ...
Jennifer L. Wong, Seapahn Megerian, Miodrag Potkon...
140
Voted
ICML
1998
IEEE
16 years 3 months ago
Value Function Based Production Scheduling
Production scheduling, the problem of sequentially con guring a factory to meet forecasted demands, is a critical problem throughout the manufacturing industry. The requirement of...
Jeff G. Schneider, Justin A. Boyan, Andrew W. Moor...
239
Voted
POPL
2007
ACM
16 years 2 months ago
Locality approximation using time
Reuse distance (i.e. LRU stack distance) precisely characterizes program locality and has been a basic tool for memory system research since the 1970s. However, the high cost of m...
Xipeng Shen, Jonathan Shaw, Brian Meeker, Chen Din...
PODS
2006
ACM
216views Database» more  PODS 2006»
16 years 2 months ago
Cache-oblivious string B-trees
B-trees are the data structure of choice for maintaining searchable data on disk. However, B-trees perform suboptimally ? when keys are long or of variable length, ? when keys are...
Michael A. Bender, Martin Farach-Colton, Bradley C...
99
Voted
FOCS
2009
IEEE
15 years 9 months ago
KKL, Kruskal-Katona, and Monotone Nets
We generalize the Kahn-Kalai-Linial (KKL) Theorem to random walks on Cayley and Schreier graphs, making progress on an open problem of Hoory, Linial, and Wigderson. In our general...
Ryan O'Donnell, Karl Wimmer