Sciweavers

1151 search results - page 175 / 231
» Modelling Digital Circuits Problems with Set Constraints
Sort
View
COMPGEOM
2008
ACM
14 years 11 months ago
Routing a maximum number of disks through a scene of moving obstacles
This video illustrates an algorithm for computing a maximum number of disjoint paths for unit disks moving among a set of dynamic obstacles in the plane. The problem is motivated ...
Joondong Kim, Joseph S. B. Mitchell, Valentin Poli...
JPDC
2008
122views more  JPDC 2008»
14 years 9 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...
ICSOC
2010
Springer
14 years 7 months ago
Efficient QoS-Aware Service Composition with a Probabilistic Service Selection Policy
Service-Oriented Architecture enables the composition of loosely coupled services provided with varying Quality of Service (QoS) levels. Given a composition, finding the set of ser...
Adrian Klein, Fuyuki Ishikawa, Shinichi Honiden
SIAMMAX
2010
145views more  SIAMMAX 2010»
14 years 4 months ago
Adaptive First-Order Methods for General Sparse Inverse Covariance Selection
In this paper, we consider estimating sparse inverse covariance of a Gaussian graphical model whose conditional independence is assumed to be partially known. Similarly as in [5],...
Zhaosong Lu
TSE
2010
132views more  TSE 2010»
14 years 4 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