Sciweavers

27354 search results - page 5124 / 5471
» Distributed And Parallel Computing
Sort
View
ANOR
2004
116views more  ANOR 2004»
15 years 6 months ago
Approximations and Randomization to Boost CSP Techniques
Abstract. In recent years we have seen an increasing interest in combining constraint satisfaction problem (CSP) formulations and linear programming (LP) based techniques for solvi...
Carla P. Gomes, David B. Shmoys
AROBOTS
2002
113views more  AROBOTS 2002»
15 years 6 months ago
An Incremental Self-Deployment Algorithm for Mobile Sensor Networks
This paper describes an incremental deployment algorithm for mobile sensor networks. A mobile sensor network is a distributed collection of nodes, each of which has sensing, compu...
Andrew Howard, Maja J. Mataric, Gaurav S. Sukhatme
CLASSIFICATION
2004
59views more  CLASSIFICATION 2004»
15 years 6 months ago
Oscillation Heuristics for the Two-group Classification Problem
: We propose a new nonparametric family of oscillation heuristics for improving linear classifiers in the two-group discriminant problem. The heuristics are motivated by the intuit...
Ognian Asparouhov, Paul A. Rubin
COMCOM
2004
98views more  COMCOM 2004»
15 years 6 months ago
Proactive resource provisioning
Allocating resources in networks to QoS flows may require undesirable delays or costs. We consider a dynamic Service Level Agreement (SLA) negotiation scheme between peer autonomo...
Eric Chi, Michael Fu, Jean C. Walrand
CONCURRENCY
2004
93views more  CONCURRENCY 2004»
15 years 6 months ago
Studying protein folding on the Grid: experiences using CHARMM on NPACI resources under Legion
-- One of the benefits of a computational grid is the ability to run high-performance applications over distributed resources simply and securely. We demonstrated this benefit with...
Anand Natrajan, Michael Crowley, Nancy Wilkins-Die...
« Prev « First page 5124 / 5471 Last » Next »