Sciweavers

1778 search results - page 181 / 356
» The Theory of Probabilistic Databases
Sort
View
SIGECOM
2005
ACM
92views ECommerce» more  SIGECOM 2005»
15 years 12 months ago
True costs of cheap labor are hard to measure: edge deletion and VCG payments in graphs
We address the problem of lowering the buyer’s expected payments in shortest path auctions, where the buyer’s goal is to purchase a path in a graph in which edges are owned by...
Edith Elkind
COCO
1994
Springer
100views Algorithms» more  COCO 1994»
15 years 10 months ago
Relative to a Random Oracle, NP is Not Small
Resource-bounded measure as originated by Lutz is an extension of classical measure theory which provides a probabilistic means of describing the relative sizes of complexity clas...
Steven M. Kautz, Peter Bro Miltersen
SGP
2004
15 years 8 months ago
Comparing Point Clouds
Point clouds are one of the most primitive and fundamental surface representations. A popular source of point clouds are three dimensional shape acquisition devices such as laser ...
Facundo Mémoli, Guillermo Sapiro
AAAI
2007
15 years 8 months ago
Dominance and Equivalence for Sensor-Based Agents
This paper describes recent results from the robotics community that develop a theory, similar in spirit to the theory of computation, for analyzing sensor-based agent systems. Th...
Jason M. O'Kane, Steven M. LaValle
GECCO
2008
Springer
124views Optimization» more  GECCO 2008»
15 years 7 months ago
Runtime analysis of binary PSO
We investigate the runtime of the Binary Particle Swarm Optimization (PSO) algorithm introduced by Kennedy and Eberhart (1997). The Binary PSO maintains a global best solution and...
Dirk Sudholt, Carsten Witt