Sciweavers

686 search results - page 89 / 138
» Nonmonotonic inference operations
Sort
View
PEPM
2009
ACM
14 years 6 months ago
Bidirectional data-flow analyses, type-systematically
We show that a wide class of bidirectional data-flow analyses and program optimizations based on them admit declarative descriptions in the form of type systems. The salient feat...
Maria João Frade, Ando Saabas, Tarmo Uustal...
VEE
2009
ACM
157views Virtualization» more  VEE 2009»
14 years 4 months ago
Task-aware virtual machine scheduling for I/O performance
The use of virtualization is progressively accommodating diverse and unpredictable workloads as being adopted in virtual desktop and cloud computing environments. Since a virtual ...
Hwanju Kim, Hyeontaek Lim, Jinkyu Jeong, Heeseung ...
IWMM
2009
Springer
164views Hardware» more  IWMM 2009»
14 years 4 months ago
Live heap space analysis for languages with garbage collection
The peak heap consumption of a program is the maximum size of the live data on the heap during the execution of the program, i.e., the minimum amount of heap space needed to run t...
Elvira Albert, Samir Genaim, Miguel Gómez-Z...
ICTAI
2007
IEEE
14 years 4 months ago
Establishing Logical Rules from Empirical Data
We review a method of generating logical rules, or axioms, from empirical data. This method, using closed set properties of formal concept analysis, has been previously described ...
John L. Pfaltz
ISRR
2005
Springer
154views Robotics» more  ISRR 2005»
14 years 3 months ago
Session Overview Planning
ys when planning meant searching for a sequence of abstract actions that satisfied some symbolic predicate. Robots can now learn their own representations through statistical infe...
Nicholas Roy, Roland Siegwart