Sciweavers

14165 search results - page 527 / 2833
» The generalized two-server problem
Sort
View
ESA
1998
Springer
108views Algorithms» more  ESA 1998»
15 years 11 months ago
Finding an Optimal Path without Growing the Tree
In this paper, we study a class of optimal path problems with the following phenomenon: The space complexity of the algorithms for reporting the lengths of single-source optimal pa...
Danny Z. Chen, Ovidiu Daescu, Xiaobo Hu, Jinhui Xu
AUSAI
2007
Springer
15 years 11 months ago
Branching Rules for Satisfiability Analysed with Factor Analysis
Factor analysis is a statistical technique for reducing the number of factors responsible for a matrix of correlations to a smaller number of factors that may reflect underlying va...
Richard J. Wallace, Stuart Bain
IAT
2009
IEEE
15 years 11 months ago
Offline Planning for Communication by Exploiting Structured Interactions in Decentralized MDPs
Variants of the decentralized MDP model focus on problems exhibiting some special structure that makes them easier to solve in practice. Our work is concerned with two main issues...
Hala Mostafa, Victor R. Lesser
GECCO
2006
Springer
170views Optimization» more  GECCO 2006»
15 years 10 months ago
Towards an evolutionary tool for the allocation of supermarket shelf space
In this paper we set the first steps towards the development of a commercially viable tool that uses evolutionary computation to address the Product to Shelf Allocation Problem (P...
Anna Esparcia-Alcázar, Lidia Lluch-Revert, ...
ESA
2008
Springer
115views Algorithms» more  ESA 2008»
15 years 8 months ago
Deterministic Sampling Algorithms for Network Design
For several NP-hard network design problems, the best known approximation algorithms are remarkably simple randomized algorithms called Sample-Augment algorithms in [11]. The algor...
Anke van Zuylen