Sciweavers

5314 search results - page 338 / 1063
» Hybrid Dynamic Programming
Sort
View
ANOR
2006
69views more  ANOR 2006»
15 years 6 months ago
A splitting method for stochastic programs
This paper derives a new splitting-based decomposition algorithm for convex stochastic programs. It combines certain attractive features of the progressive hedging algorithm of Roc...
Teemu Pennanen, Markku Kallio
195
Voted
IJFCS
2006
63views more  IJFCS 2006»
15 years 6 months ago
Critical Path Scheduling Parallel Programs on an Unbounded Number of Processors
In this paper we present an efficient algorithm for compile-time scheduling and clustering of parallel programs onto parallel processing systems with distributed memory, which is ...
Mourad Hakem, Franck Butelle
SIGSOFT
2005
ACM
16 years 7 months ago
Matching execution histories of program versions
We develop a method for matching dynamic histories of program executions of two program versions. The matches produced can be useful in many applications including software piracy...
Xiangyu Zhang, Rajiv Gupta
ECOOP
2011
Springer
14 years 6 months ago
Frequency Estimation of Virtual Call Targets for Object-Oriented Programs
Abstract. The information of execution frequencies of virtual call targets is valuable for program analyses and optimizations of object-oriented programs. However, to obtain this i...
Cheng Zhang, Hao Xu, Sai Zhang, Jianjun Zhao, Yuti...
156
Voted
SEFM
2006
IEEE
16 years 19 days ago
Formalizing AspectJ Weaving for Static Pointcuts
The Aspect Oriented Programming is a new programming paradigm that provides a means of encapsulation of crosscuting concerns in software. This paper describes a formal semantics o...
Nadia Belblidia, Mourad Debbabi