3433 search results - page 181 / 687 » Heuristics for a bidding problem |
188
click to vote
INFOCOM
2000
IEEE
15 years 11 months ago
2000
IEEE
— An ad hoc network may be logically represented as a set of clusters. The clusterheads form a -hop dominating set. Each node is at most hops from a clusterhead. Clusterheads for...
154
click to vote
ESA
2006
Springer
15 years 10 months ago
2006
Springer
We consider an optimization problem arising in the design of controllers for OLED displays. Our objective is to minimize amplitude of the electrical current through the diodes whic...
166
click to vote
WAE
2000
15 years 8 months ago
2000
Abstract. In this paper we present a heuristic based on dynamic approximations for improving the well-known Schnorr-Euchner lattice basis reduction algorithm. In particular, the ne...
144
click to vote
AAAI
1994
15 years 8 months ago
1994
We present the results of an empirical study of several constraint satisfaction search algorithms and heuristics. Using a random problem generator that allows us to create instanc...
147
click to vote
WEA
2005
Springer
16 years 1 days ago
2005
Springer
We present the problem of statically distributing instructions of a common programming language, a problem which we prove equivalent to the multiterminal cut problem. We design eï¬...