Sciweavers

43264 search results - page 8101 / 8653
» Comparing models of computation
Sort
View
LATA
2009
Springer
15 years 11 months ago
Rigid Tree Automata
We introduce the class of Rigid Tree Automata (RTA), an extension of standard bottom-up automata on ranked trees with distinguished states called rigid. Rigid states define a rest...
Florent Jacquemard, Francis Klay, Camille Vacher
LATA
2009
Springer
15 years 11 months ago
Termination of Priority Rewriting
Introducing priorities on rules in rewriting increases their expressive power and helps to limit computations. Priority rewriting is used in rule-based programming as well as in f...
Isabelle Gnaedig
DATE
2009
IEEE
155views Hardware» more  DATE 2009»
15 years 11 months ago
Using non-volatile memory to save energy in servers
Abstract—Recent breakthroughs in circuit and process technology have enabled new usage models for non-volatile memory technologies such as Flash and phase change RAM (PCRAM) in t...
David Roberts, Taeho Kgil, Trevor N. Mudge
DATE
2009
IEEE
113views Hardware» more  DATE 2009»
15 years 11 months ago
Scalable compile-time scheduler for multi-core architectures
As the number of cores continues to grow in both digital signal and general purpose processors, tools which perform automatic scheduling from model-based designs are of increasing...
Maxime Pelcat, Pierrick Menuet, Slaheddine Aridhi,...
EDOC
2009
IEEE
15 years 11 months ago
Using Enterprise Architecture Management Patterns to Complement TOGAF
—The design of an Enterprise Architecture (EA) management function for an enterprise is no easy task. Various frameworks exist as well as EA management tools, which promise to de...
Sabine Buckl, Alexander M. Ernst, Florian Matthes,...
« Prev « First page 8101 / 8653 Last » Next »