400 search results - page 49 / 80 » Backtracking |
TROB
2008
13 years 8 months ago
2008
The best of Kalman-filter-based frameworks reported in the literature for rigid object tracking work well only if the object motions are smooth (which allows for tight uncertainty ...
CONSTRAINTS
1998
13 years 8 months ago
1998
Many temporal applications like planning and scheduling can be viewed as special cases of the numeric and symbolic temporal constraint satisfaction problem. Thus we have developed ...
WSDM
2012
ACM
12 years 4 months ago
2012
ACM
Today’s Web browsers allow users to open links in new windows or tabs. This action, which we call ‘branching’, is sometimes performed on search results when the user plans t...
DAC
2004
ACM
14 years 9 months ago
2004
ACM
Instances of the Boolean satisfiability problem (SAT) arise in many areas of circuit design and verification. These instances are typically constructed from some human-designed ar...
CHI
2007
ACM
14 years 9 months ago
2007
ACM
This paper presents results of an extensive long-term clickstream study of Web browser usage. Focusing on character and challenges of page revisitation, previous findings from sev...