Sciweavers

88 search results - page 5 / 18
» The Multidimensional Knapsack Problem: Structure and Algorit...
Sort
View
ICML
2010
IEEE
13 years 8 months ago
Multi-Task Learning of Gaussian Graphical Models
We present multi-task structure learning for Gaussian graphical models. We discuss uniqueness and boundedness of the optimal solution of the maximization problem. A block coordina...
Jean Honorio, Dimitris Samaras
OTM
2005
Springer
14 years 28 days ago
QoS-Aware Composition of Web Services: An Evaluation of Selection Algorithms
A composition arranges available services resulting in a defined flow of executions. Before the composition is carried out, a discovery service identifies candidate services. Th...
Michael C. Jaeger, Gero Mühl, Sebastian Golze
TSE
2010
132views more  TSE 2010»
13 years 2 months ago
ASCENT: An Algorithmic Technique for Designing Hardware and Software in Tandem
Search-based software engineering is an emerging paradigm that uses automated search algorithms to help designers iteratively find solutions to complicated design problems. For exa...
Jules White, Brian Doughtery, Douglas C. Schmidt
ANOR
2010
123views more  ANOR 2010»
13 years 7 months ago
Nature inspired genetic algorithms for hard packing problems
This paper presents two novel genetic algorithms (GAs) for hard industrially relevant packing problems. The design of both algorithms is inspired by aspects of molecular genetics,...
Philipp Rohlfshagen, John A. Bullinaria
SODA
2010
ACM
409views Algorithms» more  SODA 2010»
14 years 4 months ago
Data Structures for Range Minimum Queries in Multidimensional Arrays
Given a d-dimensional array A with N entries, the Range Minimum Query (RMQ) asks for the minimum element within a contiguous subarray of A. The 1D RMQ problem has been studied int...
Hao Yuan, Mikhail J. Atallah