Sciweavers

1688 search results - page 264 / 338
» Implementing Optimizations at Decode Time
Sort
View
AIPS
2010
13 years 10 months ago
Action Elimination and Plan Neighborhood Graph Search: Two Algorithms for Plan Improvement
Compared to optimal planners, satisficing planners can solve much harder problems but may produce overly costly and long plans. Plan quality for satisficing planners has become in...
Hootan Nakhost, Martin Müller 0003
CGO
2008
IEEE
13 years 10 months ago
Comprehensive path-sensitive data-flow analysis
Data-flow analysis is an integral part of any aggressive optimizing compiler. We propose a framework for improving the precision of data-flow analysis in the presence of complex c...
Aditya V. Thakur, R. Govindarajan
SIROCCO
2008
13 years 9 months ago
Average Binary Long-Lived Consensus: Quantifying the Stabilizing Role Played by Memory
Abstract. Consider a system composed of n sensors operating in synchronous rounds. In each round an input vector of sensor readings x is produced, where the i-th entry of x is a bi...
Florent Becker, Sergio Rajsbaum, Ivan Rapaport, Er...
ADHOC
2010
123views more  ADHOC 2010»
13 years 8 months ago
An analysis of the lifetime of OLSR networks
The Optimized Link State Routing (OLSR) protocol is a well-known route discovery protocol for ad-hoc networks. OLSR optimizes the flooding of link state information through the ne...
Jan-Maarten Verbree, Maurits de Graaf, Johann Huri...
DMIN
2010
262views Data Mining» more  DMIN 2010»
13 years 6 months ago
SMO-Style Algorithms for Learning Using Privileged Information
Recently Vapnik et al. [11, 12, 13] introduced a new learning model, called Learning Using Privileged Information (LUPI). In this model, along with standard training data, the tea...
Dmitry Pechyony, Rauf Izmailov, Akshay Vashist, Vl...