Sciweavers

4067 search results - page 133 / 814
» Programs for Applying Symmetries
Sort
View
ICTAC
2007
Springer
14 years 2 months ago
Discovering Non-linear Ranking Functions by Solving Semi-algebraic Systems
Abstract. Differing from [6] this paper reduces non-linear ranking function discovering for polynomial programs to semi-algebraic system solving, and demonstrates how to apply the...
Yinghua Chen, Bican Xia, Lu Yang, Naijun Zhan, Cha...
SAC
2005
ACM
14 years 1 months ago
[a]C#: C# with a customizable code annotation mechanism
Reflective programming is becoming popular due to the increasing set of dynamic services provided by execution environments like JVM and CLR. With custom attributes Microsoft int...
Walter Cazzola, Antonio Cisternino, Diego Colombo
WWW
2005
ACM
14 years 9 months ago
Static approximation of dynamically generated Web pages
Server-side programming is one of the key technologies that support today's WWW environment. It makes it possible to generate Web pages dynamically according to a user's...
Yasuhiko Minamide
GECCO
2010
Springer
150views Optimization» more  GECCO 2010»
14 years 1 months ago
Object-level recombination of commodity applications
This paper presents ObjRecombGA, a genetic algorithm framework for recombining related programs at the object file level. A genetic algorithm guides the selection of object file...
Blair Foster, Anil Somayaji
ESOP
2010
Springer
14 years 5 months ago
Amortized Resource Analysis with Polynomial Potential - A Static Inference of Polynomial Bounds for Functional Programs
In 2003, Hofmann and Jost introduced a type system that uses a potential-based amortized analysis to infer bounds on the resource consumption of (first-order) functional programs. ...
Jan Hoffmann and Martin Hofmann