Sciweavers

5592 search results - page 1021 / 1119
» On Random Betweenness Constraints
Sort
View
195
Voted
GECCO
2003
Springer
415views Optimization» more  GECCO 2003»
15 years 9 months ago
Evolutionary Algorithms for Two Problems from the Calculus of Variations
Abstract. A brachistochrone is the path along which a weighted particle falls most quickly from one point to another, and a catenary is the smooth curve connecting two points whose...
Bryant A. Julstrom
PLDI
2010
ACM
15 years 9 months ago
Smooth interpretation
We present smooth interpretation, a method to systematically approximate numerical imperative programs by smooth mathematical functions. This approximation facilitates the use of ...
Swarat Chaudhuri, Armando Solar-Lezama
ICPP
2002
IEEE
15 years 9 months ago
ART: Robustness of Meshes and Tori for Parallel and Distributed Computation
In this paper, we formulate the array robustness theorems (ARTs) for efficient computation and communication on faulty arrays. No hardware redundancy is required and no assumptio...
Chi-Hsiang Yeh, Behrooz Parhami
137
Voted
SIGECOM
2010
ACM
226views ECommerce» more  SIGECOM 2010»
15 years 9 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
153
Voted
SIGMETRICS
2010
ACM
214views Hardware» more  SIGMETRICS 2010»
15 years 9 months ago
Distributed sensor network localization from local connectivity: performance analysis for the HOP-TERRAIN algorithm
This paper addresses the problem of determining the node locations in ad-hoc sensor networks when only connectivity information is available. In previous work, we showed that the ...
Amin Karbasi, Sewoong Oh
« Prev « First page 1021 / 1119 Last » Next »