Sciweavers

14548 search results - page 2545 / 2910
» The Optimal Path-Matching Problem
Sort
View
SIGECOM
2010
ACM
226views ECommerce» more  SIGECOM 2010»
15 years 11 months ago
Auctions with online supply
We study the problem of selling identical goods to n unit-demand bidders in a setting in which the total supply of goods is unknown to the mechanism. Items arrive dynamically, and...
Moshe Babaioff, Liad Blumrosen, Aaron Roth
GECCO
2010
Springer
173views Optimization» more  GECCO 2010»
15 years 11 months ago
Evolving the placement and density of neurons in the hyperneat substrate
The Hypercube-based NeuroEvolution of Augmenting Topologies (HyperNEAT) approach demonstrated that the pattern of weights across the connectivity of an artificial neural network ...
Sebastian Risi, Joel Lehman, Kenneth O. Stanley
ICA3PP
2010
Springer
15 years 11 months ago
InterCloud: Utility-Oriented Federation of Cloud Computing Environments for Scaling of Application Services
Abstract. Cloud computing providers have setup several data centers at different geographical locations over the Internet in order to optimally serve needs of their customers aroun...
Rajkumar Buyya, Rajiv Ranjan, Rodrigo N. Calheiros
SIGMOD
2000
ACM
158views Database» more  SIGMOD 2000»
15 years 11 months ago
NiagaraCQ: A Scalable Continuous Query System for Internet Databases
Continuous queries are persistent queries that allow users to receive new results when they become available. While continuous query systems can transform a passive web into an ac...
Jianjun Chen, David J. DeWitt, Feng Tian, Yuan Wan...
SIGCOMM
1999
ACM
15 years 11 months ago
A Simple Approximation to Minimum-Delay Routing
The conventional approach to routing in computer networks consists of using a heuristic to compute a single shortest path from a source to a destination. Single-path routing is ve...
Srinivas Vutukury, J. J. Garcia-Luna-Aceves
« Prev « First page 2545 / 2910 Last » Next »