Sciweavers

4679 search results - page 505 / 936
» Modeling When Connections Are the Problem
Sort
View
INFOCOM
2006
IEEE
16 years 25 days ago
Mistreatment in Distributed Caching Groups: Causes and Implications
— Although cooperation generally increases the amount of resources available to a community of nodes, thus improving individual and collective performance, it also allows for the...
Nikolaos Laoutaris, Georgios Smaragdakis, Azer Bes...
IOR
2006
91views more  IOR 2006»
15 years 6 months ago
Robust One-Period Option Hedging
The paper considers robust optimization to cope with uncertainty about the stock return process in one period option hedging problems. The robust approach relates portfolio choice ...
Frank Lutgens, Jos F. Sturm, Antoon Kolen
SMA
2009
ACM
134views Solid Modeling» more  SMA 2009»
16 years 1 months ago
Exact Delaunay graph of smooth convex pseudo-circles: general predicates, and implementation for ellipses
We examine the problem of computing exactly the Delaunay graph (and the dual Voronoi diagram) of a set of, possibly intersecting, smooth convex pseudo-circles in the Euclidean pla...
Ioannis Z. Emiris, Elias P. Tsigaridas, George M. ...
WABI
2004
Springer
16 years 4 days ago
A Polynomial-Time Algorithm for the Matching of Crossing Contact-Map Patterns
Abstract. Contact maps are a model to capture the core information in the structure of biological molecules, e.g., proteins. A contact map consists of an ordered set ¡ of elements...
Jens Gramm
IPTPS
2003
Springer
16 years 4 hour ago
Rationality and Self-Interest in Peer to Peer Networks
Much of the existing work in peer to peer networking assumes that users will follow prescribed protocols without deviation. This assumption ignores the user’s ability to modify ...
Jeffrey Shneidman, David C. Parkes