Sciweavers

494 search results - page 46 / 99
» Heap Building Bounds
Sort
View
MONET
2006
102views more  MONET 2006»
14 years 11 months ago
Locating and Bypassing Holes in Sensor Networks
In real sensor network deployments, spatial distributions of sensors are usually far from being uniform. Such networks often contain regions without enough sensor nodes, which we ...
Qing Fang, Jie Gao, Leonidas J. Guibas
JAIR
2007
103views more  JAIR 2007»
14 years 11 months ago
Obtaining Reliable Feedback for Sanctioning Reputation Mechanisms
Reputation mechanisms offer an effective alternative to verification authorities for building trust in electronic markets with moral hazard. Future clients guide their business...
Radu Jurca, Boi Faltings
APAL
2004
105views more  APAL 2004»
14 years 11 months ago
Dual weak pigeonhole principle, Boolean complexity, and derandomization
We study the extension (introduced as BT in [5]) of the theory S1 2 by instances of the dual (onto) weak pigeonhole principle for p-time functions, dWPHP(PV )x x2 . We propose a n...
Emil Jerábek
WCET
2010
14 years 9 months ago
A Code Policy Guaranteeing Fully Automated Path Analysis
Calculating the worst-case execution time (WCET) of real-time tasks is still a tedious job. Programmers are required to provide additional information on the program flow, analyzi...
Benedikt Huber, Peter P. Puschner
ICMLA
2009
14 years 8 months ago
Sensitivity Analysis of POMDP Value Functions
In sequential decision making under uncertainty, as in many other modeling endeavors, researchers observe a dynamical system and collect data measuring its behavior over time. The...
Stéphane Ross, Masoumeh T. Izadi, Mark Merc...