Sciweavers

833 search results - page 135 / 167
» Flexible Models for Dynamic Linking
Sort
View
97
Voted
IJHPCA
2006
109views more  IJHPCA 2006»
15 years 15 days ago
A Resource Leasing Policy for on-Demand Computing
Leasing computational resources for on-demand computing is now a viable option for providers of network services. Temporary spikes or lulls in demand for a service can be accommod...
Darin England, Jon B. Weissman
98
Voted
JAIR
2008
98views more  JAIR 2008»
15 years 14 days ago
Loosely Coupled Formulations for Automated Planning: An Integer Programming Perspective
We represent planning as a set of loosely coupled network flow problems, where each network corresponds to one of the state variables in the planning domain. The network nodes cor...
Menkes Hector Louis van den Briel, Thomas Vossen, ...
JSS
2008
136views more  JSS 2008»
15 years 14 days ago
Specification, decomposition and agent synthesis for situation-aware service-based systems
Service-based systems are distributed computing systems with the major advantage of enabling rapid composition of distributed applications, such as collaborative research and deve...
Stephen S. Yau, Haishan Gong, Dazhi Huang, Wei Gao...
103
Voted
TOCS
2008
146views more  TOCS 2008»
15 years 12 days ago
Bigtable: A Distributed Storage System for Structured Data
Bigtable is a distributed storage system for managing structured data that is designed to scale to a very large size: petabytes of data across thousands of commodity servers. Many...
Fay Chang, Jeffrey Dean, Sanjay Ghemawat, Wilson C...
118
Voted
CDC
2010
IEEE
112views Control Systems» more  CDC 2010»
14 years 7 months ago
Online Convex Programming and regularization in adaptive control
Online Convex Programming (OCP) is a recently developed model of sequential decision-making in the presence of time-varying uncertainty. In this framework, a decisionmaker selects ...
Maxim Raginsky, Alexander Rakhlin, Serdar Yük...