Sciweavers

11716 search results - page 322 / 2344
» Computable symbolic dynamics
Sort
View
176
Voted
EUROPAR
1998
Springer
15 years 11 months ago
A Lower Bound for Dynamic Scheduling of Data Parallel Programs
Instruction Balanced Time Slicing IBTS allows multiple parallel jobs to be scheduled in a manner akin to the well-known gang scheduling scheme in parallel computers. IBTS however a...
Fabrício Alves Barbosa da Silva, Luis Migue...
LICS
2008
IEEE
16 years 1 months ago
Collapsible Pushdown Automata and Recursion Schemes
Collapsible pushdown automata (CPDA) are a new kind of higher-order pushdown automata in which every symbol in the stack has a link to a stack situated somewhere below it. In addi...
Matthew Hague, Andrzej S. Murawski, C.-H. Luke Ong...
SIGCSE
2000
ACM
453views Education» more  SIGCSE 2000»
15 years 11 months ago
Aristotle and object-oriented programming: why modern students need traditional logic
Classifying is a central activity in object-oriented programming and distinguishes it from procedural programming. Traditional logic, initiated by Aristotle, assigns classificatio...
Derek Rayside, Gerard T. Campbell
WCNC
2010
IEEE
15 years 10 months ago
Many-To-Many Communications via Space-Time Network Coding
—In this paper, the mutual cooperative communication between multiple nodes in a wireless network is efficiently achieved through a novel concept of Space-Time Network Coding (S...
Mohammed W. Baidas, Hung-Quoc Lai, K. J. Ray Liu
CP
2000
Springer
15 years 10 months ago
Expressiveness of Full First Order Constraints in the Algebra of Finite or Infinite Trees
We are interested in the expressiveness of constraints represented by general first order formulae, with equality as unique relation symbol and function symbols taken from an infi...
Alain Colmerauer, Thi-Bich-Hanh Dao