Sciweavers

1508 search results - page 12 / 302
» Efficient Path Profiling
Sort
View
ISR
2006
13 years 9 months ago
How Often Should Reputation Mechanisms Update a Trader's Reputation Profile?
Reputation mechanisms have become an important component of electronic markets, helping to build trust and elicit cooperation among loosely connected and geographically dispersed ...
Chrysanthos Dellarocas
ICDE
2008
IEEE
190views Database» more  ICDE 2008»
14 years 11 months ago
Efficient Query Processing in Large Traffic Networks
Abstract-- We present an original graph embedding to speedup distance-range and k-nearest neighbor queries on static and/or dynamic objects located on a (weighted) graph. Our metho...
Hans-Peter Kriegel, Matthias Renz, Peer Kröge...
ICALP
2009
Springer
14 years 10 months ago
LTL Path Checking Is Efficiently Parallelizable
We present an AC1 (logDCFL) algorithm for checking LTL formulas over finite paths, thus establishing that the problem can be efficiently parallelized. Our construction provides a f...
Lars Kuhtz, Bernd Finkbeiner
JAVA
2000
Springer
14 years 1 months ago
A portable sampling-based profiler for Java virtual machines
This paper describes a portable and efficient sampling-based online measurement system for production-level Java virtual machines. This system is designed to provide continuous re...
John Whaley
DAC
2007
ACM
14 years 10 months ago
Global Critical Path: A Tool for System-Level Timing Analysis
An effective method for focusing optimization effort on the most important parts of a design is to examine those elements on the critical path. Traditionally, the critical path is...
Girish Venkataramani, Mihai Budiu, Tiberiu Chelcea...