Sciweavers

211 search results - page 24 / 43
» Solving Games Without Determinization
Sort
View
ATAL
2007
Springer
15 years 4 months ago
Bidding algorithms for a distributed combinatorial auction
Distributed allocation and multiagent coordination problems can be solved through combinatorial auctions. However, most of the existing winner determination algorithms for combina...
Benito Mendoza García, José M. Vidal
ICDE
2000
IEEE
168views Database» more  ICDE 2000»
15 years 11 months ago
PAC Nearest Neighbor Queries: Approximate and Controlled Search in High-Dimensional and Metric Spaces
In high-dimensional and complex metric spaces, determining the nearest neighbor (NN) of a query object ? can be a very expensive task, because of the poor partitioning operated by...
Paolo Ciaccia, Marco Patella
PERCOM
2005
ACM
15 years 10 months ago
Adaptive Temporal Radio Maps for Indoor Location Estimation
In this paper, we present a novel method to adapt the temporal radio maps for indoor location determination by offsetting the variational environmental factors using data mining t...
Jie Yin, Qiang Yang, Lionel M. Ni
ISAAC
2004
Springer
153views Algorithms» more  ISAAC 2004»
15 years 3 months ago
Canonical Data Structure for Interval Probe Graphs
The class of interval probe graphs is introduced to deal with the physical mapping and sequencing of DNA as a generalization of interval graphs. The polynomial time recognition al...
Ryuhei Uehara
HASE
2007
IEEE
15 years 4 months ago
On the Verifiability of Programs Written in the Feature Language Extensions
High assurance in embedded system software is difficult to attain. Verification relies on testing. The unreliable and costly testing process is made much worse because the softwar...
Wu-Hon F. Leung