Sciweavers

832 search results - page 37 / 167
» Parallel algorithms for solving aggregated shortest-path pro...
Sort
View
ICPP
1998
IEEE
15 years 1 months ago
Parallel Algorithms for Airline Crew Planning on Networks of Workstations
The crew planning problem has been successfully solved on a loosely connected network of workstations (NOW) using advanced computational techniques and efficient communication pat...
Christos Goumopoulos, Panayiotis Alefragis, Efthym...
PDP
2003
IEEE
15 years 3 months ago
A Coarse-Grained Multicomputer Algorithm for the Longest Common Subsequence Problem
The paper presents a Coarse-Grained Multicomputer algorithm that solves the Longest Common Subsequence Problem. This algorithm can be implemented in the CGM with È processors in ...
Thierry Garcia, Jean Frédéric Myoupo...
CONSTRAINTS
2011
14 years 4 months ago
Dantzig-Wolfe decomposition and branch-and-price solving in G12
Abstract The G12 project is developing a software environment for stating and solving combinatorial problems by mapping a high-level model of the problem to an efficient combinatio...
Jakob Puchinger, Peter J. Stuckey, Mark G. Wallace...
92
Voted
ISPDC
2005
IEEE
15 years 3 months ago
New Challenges in Parallel Optimization
: Optimization is a healthy field targeted to find efficient solutions and algorithms to solve problems either in the academia and the industry. As the solved problems became harde...
Enrique Alba
COLT
2008
Springer
14 years 11 months ago
Adaptive Aggregation for Reinforcement Learning with Efficient Exploration: Deterministic Domains
We propose a model-based learning algorithm, the Adaptive Aggregation Algorithm (AAA), that aims to solve the online, continuous state space reinforcement learning problem in a de...
Andrey Bernstein, Nahum Shimkin