Sciweavers

1453 search results - page 144 / 291
» State and history in operating systems
Sort
View
TABLEAUX
1997
Springer
15 years 10 months ago
Tableau Methods for PA-Processes
Abstract. PA (Process algebra) is the name that has become common use to denote the algebra with a sequential and parallel operator (without communication), plus recursion. PA-proc...
Richard Mayr
JELIA
1990
Springer
15 years 10 months ago
Action Logic and Pure Induction
In Floyd-Hoare logic, programs are dynamic while assertions are static (hold at states). In action logic the two notions become one, with programs viewed as on-the-fly assertions ...
Vaughan R. Pratt
AIPS
1994
15 years 7 months ago
A Planner with Quality Goal and Its Speed-up Learning for Optimization Problem
Aimsof traditional planners had beenlimited to finding a sequenceof operators rather than finding an optimal or neax-optimalfinal state. Consequent]y, the performanceimprovementsy...
Masahiko Iwamoto
DI
2007
81views more  DI 2007»
15 years 6 months ago
Using every part of the buffalo in Windows memory analysis
All Windows memory analysis techniques depend on the examiner’s ability to translate the virtual addresses used by programs and operating system components into the true locatio...
Jesse D. Kornblum
GLOBECOM
2010
IEEE
15 years 4 months ago
Learning Interference Strategies in Cognitive ARQ Networks
Cognitive radios, which enable the coexistence on the same bandwidth of licensed primary and unlicensed secondary users, have the potential for dramatically increasing the efficien...
Sina Firouzabadi, Marco Levorato, Daniel O'Neill, ...