Sciweavers

2244 search results - page 267 / 449
» A new heuristic approach for non-convex optimization problem...
Sort
View
ATAL
2007
Springer
16 years 1 months ago
Commitment-driven distributed joint policy search
Decentralized MDPs provide powerful models of interactions in multi-agent environments, but are often very difficult or even computationally infeasible to solve optimally. Here we...
Stefan J. Witwicki, Edmund H. Durfee
INFOVIS
1998
IEEE
15 years 11 months ago
Similarity Clustering of Dimensions for an Enhanced Visualization of Multidimensional Data
The order and arrangement of dimensions (variates) is crucial for the effectiveness of a large number of visualization techniques such as parallel coordinates, scatterplots, recur...
Mihael Ankerst, Stefan Berchtold, Daniel A. Keim
JPDC
2008
122views more  JPDC 2008»
15 years 7 months ago
Stochastic robustness metric and its use for static resource allocations
This research investigates the problem of robust static resource allocation for distributed computing systems operating under imposed Quality of Service (QoS) constraints. Often, ...
Vladimir Shestak, Jay Smith, Anthony A. Maciejewsk...
DKE
2007
156views more  DKE 2007»
15 years 7 months ago
Efficient index and data allocation for wireless broadcast services
The periodic broadcasting of frequently requested data can reduce the workload of uplink channels and improve data access for users in a wireless network. Since mobile devices hav...
Shou-Chih Lo, Arbee L. P. Chen
BMCBI
2011
14 years 10 months ago
Faster Smith-Waterman database searches with inter-sequence SIMD parallelisation
Background: The Smith-Waterman algorithm for local sequence alignment is more sensitive than heuristic methods for database searching, but also more time-consuming. The fastest ap...
Torbjørn Rognes