Sciweavers

569 search results - page 61 / 114
» An Efficient Algorithm for Solving Dynamic Complex DCOP Prob...
Sort
View
AAAI
2000
13 years 9 months ago
Divide-and-Conquer Frontier Search Applied to Optimal Sequence Alignment
We present a new algorithm that reduces the space complexity of heuristic search. It is most effective for problem spaces that grow polynomially with problem size, but contain lar...
Richard E. Korf, Weixiong Zhang
JSAC
2006
93views more  JSAC 2006»
13 years 7 months ago
Multiuser Margin Optimization in Digital Subscriber Line (DSL) Channels
Abstract--This paper presents efficient multiuser margin optimization algorithms suitable for multicarrier digital subscriber line (DSL) systems using Dynamic Spectrum Management (...
Saswat Panigrahi, Yang Xu, Tho Le-Ngoc
IEAAIE
1998
Springer
13 years 12 months ago
Generating Heuristics to Control Configuration Processes
Abstract. Configuration is the process of composing a system from a set of components such that the system fulfills a set of desired demands. The configuration process relies on a ...
Benno Stein
GRID
2008
Springer
13 years 7 months ago
Cost and accuracy sensitive dynamic workflow composition over grid environments
A myriad of recent activities can be seen towards dynamic workflow composition for processing complex and data intensive problems. Meanwhile, the simultaneous emergence of the gri...
David Chiu, Sagar Deshpande, Gagan Agrawal, Rongxi...
CDC
2009
IEEE
111views Control Systems» more  CDC 2009»
14 years 11 days ago
Minimal dynamical structure realisations with application to network reconstruction from data
— Network reconstruction, i.e., obtaining network structure from data, is a central theme in systems biology, economics, and engineering. Previous work introduced dynamical struc...
Ye Yuan, Guy-Bart Vincent Stan, Sean Warnick, Jorg...