Sciweavers

9 search results - page 1 / 2
» Terror on the Internet: A Complex Issue, and Getting Harder
Sort
View
IPPS
2006
IEEE
13 years 11 months ago
Concurrent counting is harder than queuing
In both distributed counting and queuing, processors in a distributed system issue operations which are organized into a total order. In counting, each processor receives the rank...
Srikanta Tirthapura, Costas Busch
CAISE
2010
Springer
13 years 6 months ago
Monitoring and Analyzing Service-Based Internet Systems through a Model-Aware Service Environment
Abstract As service-based Internet systems get increasingly complex they become harder to manage at design time as well as at runtime. Nowadays, many systems are described in terms...
Ta'id Holmes, Uwe Zdun, Florian Daniel, Schahram D...
W2GIS
2004
Springer
13 years 10 months ago
Expansion-Based Algorithms for Finding Single Pair Shortest Path on Surface
Abstract. Finding single pair shortest paths on surface is a fundamental problem in various domains, like Geographic Information Systems (GIS) 3D applications, robotic path plannin...
Ke Deng, Xiaofang Zhou
NSDI
2008
13 years 7 months ago
Hot Crap!
esn't display abstracts. Similar issues beset START (www.softconf.com), Linklings's RM 3.2 (www. linklings.com), and EasyChair (www.easychair.org). For instance, EasyChai...
Eddie Kohler