5275 search results - page 824 / 1055 » Computing by observing |
165
click to vote
SODA
2004
ACM
15 years 8 months ago
2004
ACM
We study the average-case performance of algorithms for the binary knapsack problem. Our focus lies on the analysis of so-called core algorithms, the predominant algorithmic conce...
179
Voted
IJCAI
2003
15 years 8 months ago
2003
Estimating the location of people using a network of sensors placed throughout an environment is a fundamental challenge in smart environments and ubiquitous computing. Id-sensors...
197
click to vote
WSC
2004
15 years 8 months ago
2004
While the literature contains several adaptive sampling techniques for statistical comparison of competing simulated system configurations and for embedded statistical computation...
188
click to vote
WSC
2004
15 years 8 months ago
2004
We investigate factors that impact the effectiveness of caching to speed up discrete event simulation. Walsh and Sirer have shown that a variant of function caching (staged simula...
168
click to vote
PICS
2003
15 years 8 months ago
2003
An ongoing web-based color naming experiment † has collected a small number of unconstrained color names from a large number of observers. This has resulted in a large database ...