Sciweavers

1440 search results - page 198 / 288
» Information sharing for distributed planning
Sort
View
ICML
2007
IEEE
14 years 9 months ago
Hierarchical maximum entropy density estimation
We study the problem of simultaneously estimating several densities where the datasets are organized into overlapping groups, such as a hierarchy. For this problem, we propose a m...
David M. Blei, Miroslav Dudík, Robert E. Sc...
WWW
2008
ACM
14 years 9 months ago
Enabling secure digital marketplace
The fast development of the Web provides new ways for effective distribution of network-based digital goods. A digital marketplace provides a platform to enable Web users to effec...
Hongxia Jin, Vladimir Zbarsky
IPPS
2007
IEEE
14 years 3 months ago
A Grid-enabled Branch and Bound Algorithm for Solving Challenging Combinatorial Optimization Problems
Solving optimally large instances of combinatorial optimization problems requires a huge amount of computational resources. In this paper, we propose an adaptation of the parallel...
Mohand-Said Mezmaz, Nouredine Melab, El-Ghazali Ta...
GRID
2007
Springer
14 years 3 months ago
Dynamic, context-aware, least-privilege grid delegation
— Performing delegation in large scale, dynamic and distributed environments with large numbers of shared resources is more challenging than inside local administrative domains. ...
Mehran Ahsant, Jim Basney, S. Lennart Johnsson
ACMSE
2006
ACM
14 years 3 months ago
Using an end-to-end demonstration in an undergraduate grid computing course
In this paper, we describe a demonstration called an “End-to-End” demonstration developed for the 2005 offering of our grid computing course that was taught across the State o...
Mark A. Holliday, Barry Wilkinson, James Ruff