Sciweavers

1852 search results - page 212 / 371
» From Bi-ideals to Periodicity
Sort
View
INFORMS
2006
87views more  INFORMS 2006»
13 years 10 months ago
Early Estimates of the Size of Branch-and-Bound Trees
This paper intends to show that the time needed to solve mixed integer programming problems by branch and bound can be roughly predicted early in the solution process. We construc...
Gérard Cornuéjols, Miroslav Karamano...
CVPR
1998
IEEE
15 years 9 days ago
Using Adaptive Tracking to Classify and Monitor Activities in a Site
We describe a vision system that monitors activity in a site over extended periods of time. The system uses a distributed set of sensors to cover the site, and an adaptive tracker...
W. Eric L. Grimson, Chris Stauffer, R. Romano, L. ...
MOBISYS
2011
ACM
13 years 1 months ago
Exploiting FM radio data system for adaptive clock calibration in sensor networks
Clock synchronization is critical for Wireless Sensor Networks (WSNs) due to the need of inter-node coordination and collaborative information processing. Although many message pa...
Liqun Li, Guoliang Xing, Limin Sun, Wei Huangfu, R...
ITC
1998
IEEE
94views Hardware» more  ITC 1998»
14 years 2 months ago
A method of serial data jitter analysis using one-shot time interval measurements
A method for measuring inter-symbol interference, duty cycle distortion, random jitter and periodic jitter is described. The Blackman-Tukey method of signal analysis is used. This...
Jan B. Wilstrup
AIPS
2010
14 years 19 days ago
When Policies Can Be Trusted: Analyzing a Criteria to Identify Optimal Policies in MDPs with Unknown Model Parameters
Computing a good policy in stochastic uncertain environments with unknown dynamics and reward model parameters is a challenging task. In a number of domains, ranging from space ro...
Emma Brunskill