Sciweavers

394 search results - page 10 / 79
» Logical operations and Kolmogorov complexity
Sort
View
CP
2010
Springer
13 years 6 months ago
The Lattice Structure of Sets of Surjective Hyper-Operations
Abstract. We study the lattice structure of sets (monoids) of surjective hyper-operations on an n-element domain. Through a Galois connection, these monoids form the algebraic coun...
Barnaby Martin
CORR
2010
Springer
98views Education» more  CORR 2010»
13 years 8 months ago
Extended Computation Tree Logic
We introduce a generic extension of the popular branching-time logic CTL which refines the temporal until and release operators with formal languages. For instance, a language may ...
Roland Axelsson, Matthew Hague, Stephan Kreutzer, ...
CADE
2010
Springer
13 years 9 months ago
Global Caching for Coalgebraic Description Logics
Coalgebraic description logics offer a common semantic umbrella for extensions of description logics with reasoning principles outside relational semantics, e.g. quantitative uncer...
Rajeev Goré, Clemens Kupke, Dirk Pattinson,...
ICCD
1992
IEEE
83views Hardware» more  ICCD 1992»
14 years 24 days ago
Logical Verification of the NVAX CPU Chip Design
ct Digital's NVAX high-performance microprocessor has a complex logical design. A rigorous simulation-based verification effort was undertaken to ensure that there were no log...
Walker Anderson
ICCD
2006
IEEE
109views Hardware» more  ICCD 2006»
14 years 5 months ago
Improving Scalability and Complexity of Dynamic Scheduler through Wakeup-Based Scheduling
This paper presents a new scheduling technique to improve the speed, power, and scalability of a dynamic scheduler. In a high-performance superscalar processor, the instruction sc...
Kuo-Su Hsiao, Chung-Ho Chen