Sciweavers

10707 search results - page 569 / 2142
» Designing executable abstractions
Sort
View
ECAI
2006
Springer
15 years 11 months ago
Learning by Automatic Option Discovery from Conditionally Terminating Sequences
Abstract. This paper proposes a novel approach to discover options in the form of conditionally terminating sequences, and shows how they can be integrated into reinforcement learn...
Sertan Girgin, Faruk Polat, Reda Alhajj
EUROPAR
2000
Springer
15 years 11 months ago
Automatic Generation of Block-Recursive Codes
Abstract. Block-recursive codes for dense numerical linear algebra computations appear to be well-suited for execution on machines with deep memory hierarchies because they are e e...
Nawaaz Ahmed, Keshav Pingali
DAC
1995
ACM
15 years 11 months ago
Interval Scheduling: Fine-Grained Code Scheduling for Embedded Systems
Abstract A central problem in embedded system co-synthesis is the generation of software for lowlevel I O. Scheduling still remains a manual task because existing coarse-grained re...
Pai H. Chou, Gaetano Borriello
217
Voted
BIRTHDAY
2008
Springer
15 years 9 months ago
Some Results on the Expressive Power and Complexity of LSCs
Abstract. We survey some of the main results regarding the complexity and expressive power of Live Sequence Charts (LSCs). We first describe the two main semantics given to LSCs: a...
David Harel, Shahar Maoz, Itai Segall
EKAW
2008
Springer
15 years 9 months ago
Towards a Rule-Based Matcher Selection
Abstract. The central problems w.r.t. interoperability and data integration issues in the Semantic Web are schema and ontology matching approaches. Today it takes an expert to dete...
Malgorzata Mochol, Anja Jentzsch