Sciweavers

1487 search results - page 276 / 298
» The Computational Complexity of Link Building
Sort
View
GECCO
2007
Springer
235views Optimization» more  GECCO 2007»
14 years 2 months ago
Expensive optimization, uncertain environment: an EA-based solution
Real life optimization problems often require finding optimal solution to complex high dimensional, multimodal problems involving computationally very expensive fitness function e...
Maumita Bhattacharya
IPSN
2007
Springer
14 years 2 months ago
Sparse data aggregation in sensor networks
We study the problem of aggregating data from a sparse set of nodes in a wireless sensor network. This is a common situation when a sensor network is deployed to detect relatively...
Jie Gao, Leonidas J. Guibas, Nikola Milosavljevic,...
PKC
2007
Springer
124views Cryptology» more  PKC 2007»
14 years 2 months ago
Practical and Secure Solutions for Integer Comparison
Abstract. Yao’s classical millionaires’ problem is about securely determining whether x > y, given two input values x, y, which are held as private inputs by two parties, re...
Juan A. Garay, Berry Schoenmakers, José Vil...
ATAL
2005
Springer
14 years 2 months ago
Modeling exceptions via commitment protocols
This paper develops a model for exceptions and an approach for incorporating them in commitment protocols among autonomous agents. Modeling and handling exceptions is critical for...
Ashok U. Mallya, Munindar P. Singh
ICS
2003
Tsinghua U.
14 years 1 months ago
miNI: reducing network interface memory requirements with dynamic handle lookup
Recent work in low-latency, high-bandwidth communication systems has resulted in building user–level Network InControllers (NICs) and communication abstractions that support dir...
Reza Azimi, Angelos Bilas