Sciweavers

7103 search results - page 529 / 1421
» Program Generation and Components
Sort
View
133
Voted
WWW
2005
ACM
16 years 5 months ago
Using XForms to simplify Web programming
The difficulty of developing and deploying commercial web applications increases as the number of technologies they use increases and as the interactions between these technologie...
Richard Cardone, Danny Soroker, Alpana Tiwari
WEA
2010
Springer
289views Algorithms» more  WEA 2010»
15 years 12 months ago
Experiments with a Generic Dantzig-Wolfe Decomposition for Integer Programs
Abstract We report on experiments with turning the branch-price-andcut framework SCIP into a generic branch-price-and-cut solver. That is, given a mixed integer program (MIP), our ...
Gerald Gamrath, Marco E. Lübbecke
SAGA
2009
Springer
15 years 11 months ago
Bounds for Multistage Stochastic Programs Using Supervised Learning Strategies
We propose a generic method for obtaining quickly good upper bounds on the minimal value of a multistage stochastic program. The method is based on the simulation of a feasible dec...
Boris Defourny, Damien Ernst, Louis Wehenkel
ICS
1999
Tsinghua U.
15 years 9 months ago
Eliminating synchronization bottlenecks in object-based programs using adaptive replication
This paper presents a technique, adaptive replication, for automatically eliminating synchronization bottlenecks in multithreaded programs that perform atomic operations on object...
Martin C. Rinard, Pedro C. Diniz
ERSHOV
2009
Springer
15 years 9 months ago
Anti-unification Algorithms and Their Applications in Program Analysis
A term t is called a template of terms t1 and t2 iff t1 = t1 and t2 = t2, for some substitutions 1 and 2. A template t of t1 and t2 is called the most specific iff for any template...
Peter E. Bulychev, Egor V. Kostylev, Vladimir A. Z...