Sciweavers

707 search results - page 31 / 142
» A Practical Method for Quickly Evaluating Program Optimizati...
Sort
View
SAC
2009
ACM
14 years 2 months ago
Points-to analysis for JavaScript
JavaScript is widely used by web developers and the complexity of JavaScript programs has increased over the last year. Therefore, the need for program analysis for JavaScript is ...
Dongseok Jang, Kwang-Moo Choe
CP
2005
Springer
14 years 1 months ago
Computing and Exploiting Tree-Decompositions for Solving Constraint Networks
Methods exploiting tree-decompositions seem to provide the best approach for solving constraint networks w.r.t. the theoretical time complexity. However, they have not shown a real...
Philippe Jégou, Samba Ndiaye, Cyril Terriou...
ATAL
2006
Springer
13 years 11 months ago
Solving POMDPs using quadratically constrained linear programs
Developing scalable algorithms for solving partially observable Markov decision processes (POMDPs) is an important challenge. One promising approach is based on representing POMDP...
Christopher Amato, Daniel S. Bernstein, Shlomo Zil...
CEC
2007
IEEE
14 years 2 months ago
Non-separable fitness functions for evolutionary shape optimization benchmarking
—Target shape matching can be used as a quick and easy surrogate task when evaluating optimization algorithms intended for computationally expensive tasks, such as turbine blade ...
Tim A. Yates, Thorsten Schnier
ISORC
2006
IEEE
14 years 1 months ago
JAAT: Java Alias Analysis Tool for Program Maintenance Activities
Alias analysis is a method for extracting sets of expressions which may possibly refer to the same memory locations during program execution. Although many researchers have alread...
Fumiaki Ohata, Katsuro Inoue