Sciweavers

3897 search results - page 671 / 780
» complexity 2010
Sort
View
CN
2010
95views more  CN 2010»
13 years 10 months ago
Loop-free alternates and not-via addresses: A proper combination for IP fast reroute?
The IETF currently discusses fast reroute mechanisms for IP networks (IP FRR). IP FRR accelerates the recovery in case of network element failures and avoids micro-loops during re...
Michael Menth, Matthias Hartmann, Rüdiger Mar...
CONCURRENCY
2010
130views more  CONCURRENCY 2010»
13 years 10 months ago
Enabling high-speed asynchronous data extraction and transfer using DART
As the complexity and scale of current scientific and engineering applications grow, managing and transporting the large amounts of data they generate is quickly becoming a signif...
Ciprian Docan, Manish Parashar, Scott Klasky
COR
2010
96views more  COR 2010»
13 years 10 months ago
Strong activity rules for iterative combinatorial auctions
Activity rules have emerged in recent years as an important aspect of practical auction design. The role of an activity rule in an iterative auction is to suppress strategic behav...
Pavithra Harsha, Cynthia Barnhart, David C. Parkes...
EOR
2010
93views more  EOR 2010»
13 years 10 months ago
Two-stage flexible-choice problems under uncertainty
A significant input-data uncertainty is often present in practical situations. One approach to coping with this uncertainty is to describe the uncertainty with scenarios. A scenar...
Jurij Mihelic, Amine Mahjoub, Christophe Rapine, B...
ENTCS
2006
180views more  ENTCS 2006»
13 years 10 months ago
Mobile Synchronizing Petri Nets: A Choreographic Approach for Coordination in Ubiquitous Systems
The term Ubiquitous Computing was coined by Mark Weiser almost two decades ago. Despite all the time that has passed since Weiser's vision, ubiquitous computing still has a l...
Fernando Rosa Velardo, Olga Marroquín Alons...