4998 search results - page 624 / 1000 » The case for intentional networking |
349
click to vote
OL
2011
15 years 1 months ago
2011
We consider sequential quadratic programming (SQP) methods for solving constrained nonlinear programming problems. It is generally believed that SQP methods are sensitive to the a...
197
click to vote
TIT
2010
15 years 1 months ago
2010
In this paper, collocated and distributed space-time block codes (DSTBCs) which admit multigroup maximum-likelihood (ML) decoding are studied. First, the collocated case is conside...
238
click to vote
ICALP
2011
Springer
14 years 10 months ago
2011
Springer
We study the problem of navigating through a database of similar objects using comparisons. This problem is known to be strongly related to the small-world network design problem....
323
click to vote
CADE
2011
Springer
14 years 6 months ago
2011
Springer
Abstract. Security protocols aim at securing communications over public networks. Their design is notoriously difficult and error-prone. Formal methods have shown their usefulness ...
166
click to vote
PERCOM
2008
ACM
16 years 6 months ago
2008
ACM
Research on security in Peer-to-Peer (P2P) systems is dominated by reputation-based solutions. These solutions propagate opinions about other peers in order to help identify the b...