Sciweavers

13841 search results - page 2372 / 2769
» Algorithms and Constraint Programming
Sort
View
136
Voted
LISP
2008
104views more  LISP 2008»
15 years 4 months ago
Flattening tuples in an SSA intermediate representation
For functional programs, unboxing aggregate data structures such as tuples removes memory indirections and frees dead components of the decoupled structures. To explore the consequ...
Lukasz Ziarek, Stephen Weeks, Suresh Jagannathan
114
Voted
ENTCS
2007
107views more  ENTCS 2007»
15 years 4 months ago
Modeling Environment for Component Model Checking from Hierarchical Architecture
Application of model checking to isolated software components is not directly possible because a component does not form a complete program - the problem of missing environment oc...
Pavel Parizek, Frantisek Plasil
JUCS
2006
87views more  JUCS 2006»
15 years 4 months ago
Eliminating Redundant Join-Set Computations in Static Single Assignment
: The seminal algorithm developed by Ron Cytron, Jeanne Ferrante and colleagues in 1989 for the placement of -nodes in a control flow graph is still widely used in commercial compi...
Angela French, José Nelson Amaral
KES
2006
Springer
15 years 4 months ago
Stock Index Modeling Using Hierarchical Radial Basis Function Networks
Forecasting exchange rates is an important financial problem that is receiving increasing attention especially because of its difficulty and practical applications. This paper prop...
Yuehui Chen, Lizhi Peng, Ajith Abraham
SIGARCH
2008
94views more  SIGARCH 2008»
15 years 4 months ago
Optimized on-chip pipelining of memory-intensive computations on the cell BE
Multiprocessors-on-chip, such as the Cell BE processor, regularly suffer from restricted bandwidth to off-chip main memory. We propose to reduce memory bandwidth requirements, and...
Christoph W. Kessler, Jörg Keller
« Prev « First page 2372 / 2769 Last » Next »