536 search results - page 64 / 108 » Some Lower Bounds for the Complexity of Continuation Methods |
108
click to vote
SIGECOM
2005
ACM
15 years 7 months ago
2005
ACM
We address the problem of lowering the buyer’s expected payments in shortest path auctions, where the buyer’s goal is to purchase a path in a graph in which edges are owned by...
120
click to vote
ECCC
2000
15 years 1 months ago
2000
This article initiates a rigorous theoretical analysis of the computational power of circuits that employ modules for computing winner-take-all. Computational models that involve ...
127
click to vote
ALGOSENSORS
2009
Springer
15 years 8 months ago
2009
Springer
We introduce a framework for storing and processing kinetic data observed by sensor networks. These sensor networks generate vast quantities of data, which motivates a significant...
158
click to vote
ASIAMS
2008
IEEE
15 years 4 months ago
2008
IEEE
The paper elaborates upon the interim results achieved in resolving a few newly discovered 16th century letters now alleged to be written by Queen Mary of Scots (QMS). Despite the...
102
click to vote
WSC
2007
15 years 4 months ago
2007
The Cross-Entropy (CE) method is a modern and effective optimization method well suited to parallel implementations. There is a vast array of problems today, some of which are hig...