Sciweavers

1170 search results - page 230 / 234
» How Fast Is Too Fast
Sort
View
JAIR
2010
167views more  JAIR 2010»
14 years 11 months ago
The LAMA Planner: Guiding Cost-Based Anytime Planning with Landmarks
LAMA is a classical planning system based on heuristic forward search. Its core feature is the use of a pseudo-heuristic derived from landmarks, propositional formulas that must b...
Silvia Richter, Matthias Westphal
119
Voted
JCM
2010
119views more  JCM 2010»
14 years 11 months ago
Evaluation of Router Implementations for Explicit Congestion Control Schemes
— Explicit congestion control schemes use router feedback to overcome limitations of the standard mechanisms of the Transmission Control Protocol (TCP). These approaches require ...
Simon Hauger, Michael Scharf, Jochen Kögel, C...
106
Voted
RFIDSEC
2010
14 years 11 months ago
Optimal Security Limits of RFID Distance Bounding Protocols
Abstract. In this paper, we classify the RFID distance bounding protocols having bitwise fast phases and no final signature. We also give the theoretical security bounds for two s...
Orhun Kara, Süleyman Kardas, Muhammed Ali Bin...
CN
2010
91views more  CN 2010»
14 years 11 months ago
ILP formulations for non-simple p-cycle and p-trail design in WDM mesh networks
Conventional simple p-cycle (Preconfigured Protection Cycle) concept allows fast and capacity-efficient span protection in WDM mesh networks. Unlike simple p-cycle, non-simple p-cy...
Bin Wu, Kwan L. Yeung, Pin-Han Ho
IMC
2010
ACM
14 years 10 months ago
Speed testing without speed tests: estimating achievable download speed from passive measurements
How fast is the network? The speed at which real users can download content at different locations and at different times is an important metric for service providers. Knowledge o...
Alexandre Gerber, Jeffrey Pang, Oliver Spatscheck,...