Sciweavers

1716 search results - page 272 / 344
» Proving Conditional Termination
Sort
View
96
Voted
RTSS
1997
IEEE
15 years 5 months ago
Static priority scheduling for ATM networks
Static-priority scheduling is popular for traffic scheduling in ATM switches because it is less costly than dynamic priority scheduling while being sensitive to the delay constra...
Chengzhi Li, Riccardo Bettati, Wei Zhao
PODS
1997
ACM
124views Database» more  PODS 1997»
15 years 5 months ago
Languages for Relational Databases over Interpreted Structures
We rework parts of the classical relational theory when the underlying domain is a structure with some interpreted operations that can be used in queries. We identify parts of the...
Michael Benedikt, Leonid Libkin
HYBRID
1997
Springer
15 years 5 months ago
Time-Deterministic Hybrid Transition Systems
Hybrid transition systems in their full generality describe continuous behaviour by a set of equations in each mode an algebraic or di erential equation for each state variable in ...
Simin Nadjm-Tehrani
104
Voted
IFL
1997
Springer
153views Formal Methods» more  IFL 1997»
15 years 5 months ago
Common Subexpressions Are Uncommon in Lazy Functional Languages
Common subexpression elimination is a well-known compiler optimisation that saves time by avoiding the repetition of the same computation. In lazy functional languages, referential...
Olaf Chitil
ICRA
1994
IEEE
89views Robotics» more  ICRA 1994»
15 years 5 months ago
Computation of Shape Through Controlled Active Exploration
Accurate knowledge of depth continues to be of critical importance in robotic systems. Without accurate depth knowledge, tasks such as inspection, tracking, grasping, and collisio...
Christopher E. Smith, Nikolaos Papanikolopoulos