Sciweavers

1210 search results - page 130 / 242
» Newton's method and its use in optimization
Sort
View
AIPS
2006
15 years 3 months ago
Concurrent Probabilistic Planning in the Graphplan Framework
We consider the problem of planning optimally in potentially concurrent probabilistic domains: actions have probabilistic effects and may execute in parallel under certain conditi...
Iain Little, Sylvie Thiébaux
108
Voted
ANOR
2005
72views more  ANOR 2005»
15 years 1 months ago
An Unconstrained Quadratic Binary Programming Approach to the Vertex Coloring Problem
: The vertex coloring problem has been the subject of extensive research for many years. Driven by application potential as well as computational challenge, a variety of methods ha...
Gary A. Kochenberger, Fred Glover, Bahram Alidaee,...
IPPS
2007
IEEE
15 years 8 months ago
A Comparative Study of Parallel Metaheuristics for Protein Structure Prediction on the Computational Grid
A comparative study of parallel metaheuristics executed in grid environments is proposed, having as case study a genetic algorithm, a simulated annealing algorithm and a random se...
Alexandru-Adrian Tantar, Nouredine Melab, El-Ghaza...
64
Voted
DAGSTUHL
2007
15 years 3 months ago
Correlation-based Data Representation
The Dagstuhl Seminar Similarity-based Clustering and its Application to Medicine and Biology (07131) held in March 25–30, 2007, provided an excellent atmosphere for in-depth disc...
Marc Strickert, Udo Seiffert
CASES
2003
ACM
15 years 7 months ago
Compiler-decided dynamic memory allocation for scratch-pad based embedded systems
This paper presents a highly predictable, low overhead and yet dynamic, memory allocation strategy for embedded systems with scratch-pad memory. A scratch-pad is a fast compiler-m...
Sumesh Udayakumaran, Rajeev Barua