Sciweavers

12742 search results - page 63 / 2549
» On canonical number systems
Sort
View
DLOG
2009
14 years 9 months ago
Terminating Tableaux for SOQ with Number Restrictions on Transitive Roles
Abstract. We show that the description logic SOQ with number restrictions on transitive roles is decidable by a terminating tableau calculus. The language decided by the calculus i...
Mark Kaminski, Gert Smolka
ISSAC
2007
Springer
149views Mathematics» more  ISSAC 2007»
15 years 6 months ago
Computing numerically with functions instead of numbers
Symbolic computation with functions of a real variable suffers from combinatorial explosion of memory and computation time. The alternative chebfun system for such computations is...
Lloyd N. Trefethen
QUESTA
2011
14 years 6 months ago
Large number of queues in tandem: Scaling properties under back-pressure algorithm
Abstract We consider a system with N unit-service-rate queues in tandem, with exogenous arrivals of rate λ at queue 1, under a back-pressure (MaxWeight) algorithm: service at queu...
Alexander L. Stolyar
ISDA
2006
IEEE
15 years 5 months ago
Efficient Multiplier over Finite Field Represented in Type II Optimal Normal Basis
- Elliptic curve cryptography plays a crucial role in networking and information security area, and modular multiplication arithmetic over finite field is a necessary computation p...
Youbo Wang, Zhiguang Tian, Xinyan Bi, Zhendong Niu
FUIN
2002
107views more  FUIN 2002»
14 years 11 months ago
Comparing Refinements for Failure and Bisimulation Semantics
Refinement in bisimulation semantics is defined differently from refinement in failure semantics: in bisimulation semantics refinement is based on simulations between labelled tran...
Rik Eshuis, Maarten M. Fokkinga