3049 search results - page 518 / 610 » On the Convergence of Bound Optimization Algorithms |
CIAC
1994
Springer
14 years 29 days ago
1994
Springer
We consider the problem of maintaining a binary search tree (BST) that minimizes the average access cost needed to satisfy randomly generated requests. We analyze scenarios in whi...
CONEXT
2008
ACM
13 years 10 months ago
2008
ACM
We present the design, implementation, and evaluation of a Time Division Multiplex (TDM) MAC protocol for multihop wireless mesh networks using a programmable wireless platform. E...
SODA
2003
ACM
13 years 10 months ago
2003
ACM
With random inputs, certain decision problems undergo a “phase transition”. We prove similar behavior in an optimization context. Given a conjunctive normal form (CNF) formula...
ANOR
2005
13 years 8 months ago
2005
An alternate formulation of the classical vehicle routing problem with stochastic demands (VRPSD) is considered. We propose a new heuristic method to solve the problem. The algori...
PVLDB
2008
13 years 8 months ago
2008
The popularity of collaborative tagging sites presents a unique opportunity to explore keyword search in a context where query results are determined by the opinion of a network o...