6409 search results - page 476 / 1282 » A Computational Algorithm for Origami Design |
176
click to vote
GIS
2009
ACM
15 years 11 months ago
2009
ACM
This paper looks at the problem of data prioritization, commonly found in mobile ad-hoc networks. The proposed general solution uses a machine learning approach in order to learn ...
176
click to vote
OPODIS
2004
15 years 8 months ago
2004
Abstract. We present an efficient and practical lock-free implementation of a concurrent deque that supports parallelism for disjoint accesses and uses atomic primitives which are ...
184
click to vote
WINE
2010
Springer
15 years 4 months ago
2010
Springer
We design algorithms for computing approximately revenue-maximizing sequential postedpricing mechanisms (SPM) in K-unit auctions, in a standard Bayesian model. A seller has K copi...
181
click to vote
STACS
2005
Springer
16 years 11 days ago
2005
Springer
The subset sum problem (SSP) (given n numbers and a target bound B, find a subset of the numbers summing to B), is one of the classical NP-hard problems. The hardness of SSP vari...
175
click to vote
IPPS
1997
IEEE
15 years 11 months ago
1997
IEEE
Star networks were proposedrecently as an attractive alternative to the well-known hypercube models for interconnection networks. Extensive research has been performed that shows ...