Sciweavers

3136 search results - page 514 / 628
» Genetic programming theory
Sort
View
130
Voted
CORR
2000
Springer
133views Education» more  CORR 2000»
15 years 4 months ago
On Exponential-Time Completeness of the Circularity Problem for Attribute Grammars
Attribute grammars (AGs) are a formal technique for defining semantics of programming languages. Existing complexity proofs on the circularity problem of AGs are based on automata...
Pei-Chi Wu
EXPERT
2000
89views more  EXPERT 2000»
15 years 4 months ago
A Laboratory Course in Behavior-Based Robotics
The Behavior-Based Robotics course at Northwestern University is a project-oriented course that gives undergraduate and graduate students exposure to programming research-grade ro...
Ian Horswill
MSCS
1998
58views more  MSCS 1998»
15 years 4 months ago
Minimal Realization in Bicategories of Automata
The context of this article is the program to develop monoidal bicategories with a feedback operation as an algebra of processes, with applications to concurrency theory. The obje...
Robert D. Rosebrugh, Nicoletta Sabadini, Robert F....
TC
1998
15 years 4 months ago
An Efficient Solution to the Cache Thrashing Problem Caused by True Data Sharing
—When parallel programs are executed on multiprocessors with private caches, a set of data may be repeatedly used and modified by different threads. Such data sharing can often r...
Guohua Jin, Zhiyuan Li, Fujie Chen
175
Voted
TCS
1998
15 years 4 months ago
Algebraic Translations, Correctness and Algebraic Compiler Construction
Algebraic translation methods are argued for in many fields of science. Several examples will be considered: from the field of compiler construction, database updates, concurren...
Theo M. V. Janssen