1429 search results - page 221 / 286 » The Complexity of the Approximation of the Bandwidth Problem |
SARA
2009
Springer
14 years 6 days ago
2009
Springer
Abstract. This article presents two new algorithms whose purpose is to maintain the Max-RPC domain filtering consistency during search with a minimal memory footprint and implemen...
AGP
1996
IEEE
13 years 12 months ago
1996
IEEE
Compositional semantics allow to reason about programs in an incremental way, thus providing the formal base for the development of modular data-flow analyses. The major drawback ...
NIPS
2007
13 years 9 months ago
2007
Clustering is often formulated as a discrete optimization problem. The objective is to find, among all partitions of the data set, the best one according to some quality measure....
ADT
2008
13 years 7 months ago
2008
By range-free localization, the positions of a mobile device can be limited to the coverage area of a radio access network cell. The drawback of such approach is the coarseness of ...
MP
2006
13 years 7 months ago
2006
We present a series of related robust optimization models for placing sensors in municipal water networks to detect contaminants that are maliciously or accidentally injected. We f...