4810 search results - page 573 / 962 » Modeling Value Speculation |
194
click to vote
SIGECOM
2004
ACM
16 years 9 days ago
2004
ACM
In this paper, we combine two approaches to handling uncertainty: we use techniques for finding optimal solutions in the expected sense to solve combinatorial optimization proble...
222
click to vote
ADHOCNOW
2004
Springer
16 years 9 days ago
2004
Springer
Consider k particles, 1 red and k −1 white, chasing each other on the nodes of a graph G. If the red one catches one of the white, it “infects” it with its color. The newly ...
238
click to vote
COCOS
2003
Springer
16 years 3 days ago
2003
Springer
We investigate some approaches to solving nonconvex global optimization problems by convex nonlinear programming methods. We assume that the problem becomes convex when selected va...
211
click to vote
PLDI
2010
ACM
15 years 12 months ago
2010
ACM
Many opportunities for easy, big-win, program optimizations are missed by compilers. This is especially true in highly layered Java applications. Often at the heart of these misse...
161
click to vote
IPPS
2002
IEEE
15 years 11 months ago
2002
IEEE
In a paper presented last year at WMPP’01 [Walker01], we described the initial prototype of an associative processor implemented using field-programmable logic devices (FPLDs). ...