Sciweavers

749 search results - page 45 / 150
» Combinatory Models and Symbolic Computation
Sort
View
RTA
2005
Springer
14 years 3 months ago
Universal Algebra for Termination of Higher-Order Rewriting
Abstract. We show that the structures of binding algebras and Σmonoids by Fiore, Plotkin and Turi are sound and complete models of Klop’s Combinatory Reduction Systems (CRSs). T...
Makoto Hamana
IJHPCA
2002
101views more  IJHPCA 2002»
13 years 9 months ago
SCALA: A Performance System For Scalable Computing
Lack of effective performance-evaluation environments is a major barrier to the broader use of high performance computing. Conventional performance environments are based on profi...
Xian-He Sun, Thomas Fahringer, Mario Pantano
AAAI
2006
13 years 11 months ago
A Sequential Covering Evolutionary Algorithm for Expressive Music Performance
In this paper, we describe an evolutionary approach to one of the most challenging problems in computer music: modeling the knowledge applied by a musician when performing a score...
Rafael Ramirez, Amaury Hazan, Jordi Marine, Esteba...
GLOBECOM
2008
IEEE
14 years 4 months ago
Distributed Multi-Interface Multi-Channel Random Access
— The aggregate capacity of wireless ad-hoc networks can be substantially increased if each wireless node is equipped with multiple network interface cards (NICs) and each NIC op...
Amir Hamed Mohsenian Rad, Vincent W. S. Wong
RECOMB
2008
Springer
14 years 10 months ago
On Computing the Breakpoint Reuse Rate in Rearrangement Scenarios
In the past years, many combinatorial arguments have been made to support the theory that mammalian genome rearrangement scenarios rely heavily on breakpoint reuse. Different model...
Anne Bergeron, Julia Mixtacki, Jens Stoye