Sciweavers

6549 search results - page 1153 / 1310
» Parsimonious additive models
Sort
View
ISPAN
2002
IEEE
14 years 3 months ago
Building Ontology for Optimization and Composition of Parallel JavaBean Programs
Abstract— In this paper, we propose an ontology specification for JavaBean programs, the object component model of Java. Our specification is written using the DAML+OIL languag...
Cheng-Wei Chen, Chung-Kai Chen, Jenq Kuen Lee
STOC
2010
ACM
228views Algorithms» more  STOC 2010»
14 years 3 months ago
On the searchability of small-world networks with arbitrary underlying structure
Revisiting the “small-world” experiments of the ’60s, Kleinberg observed that individuals are very effective at constructing short chains of acquaintances between any two p...
Pierre Fraigniaud and George Giakkoupis
SIGECOM
2010
ACM
125views ECommerce» more  SIGECOM 2010»
14 years 3 months ago
Information asymmetries in pay-per-bid auctions
Recently, some mainstream e-commerce web sites have begun using “pay-per-bid” auctions to sell items, from video games to bars of gold. In these auctions, bidders incur a cost...
John W. Byers, Michael Mitzenmacher, Georgios Zerv...
SPAA
2010
ACM
14 years 3 months ago
Online capacity maximization in wireless networks
In this paper we study a dynamic version of capacity maximization in the physical model of wireless communication. In our model, requests for connections between pairs of points i...
Alexander Fanghänel, Sascha Geulen, Martin Ho...
ICALP
2010
Springer
14 years 2 months ago
Thresholded Covering Algorithms for Robust and Max-min Optimization
The general problem of robust optimization is this: one of several possible scenarios will appear tomorrow, but things are more expensive tomorrow than they are today. What should...
Anupam Gupta, Viswanath Nagarajan, R. Ravi
« Prev « First page 1153 / 1310 Last » Next »