2001 search results - page 77 / 401 » An Update on Generalized Information Theory |
SIGECOM
2003
ACM
15 years 3 months ago
2003
ACM
We consider the problem of minimizing preference elicitation in efficient multiattribute auctions, that support dynamic negotiation over non-price based attributes such as qualit...
IJON
2006
14 years 9 months ago
2006
Winner-Takes-All (WTA) prescriptions for Learning Vector Quantization (LVQ) are studied in the framework of a model situation: Two competing prototype vectors are updated accordin...
PLDI
2011
ACM
14 years 21 days ago
2011
ACM
We present a strictly bottom-up, summary-based, and precise heap analysis targeted for program verification that performs strong updates to heap locations at call sites. We firs...
MOBIHOC
2005
ACM
15 years 9 months ago
2005
ACM
Location information is very useful in the design of sensor network infrastructures. In this paper, we study the anchor-free 2D localization problem by using local angle measureme...
PLDI
2003
ACM
15 years 3 months ago
2003
ACM
In prior work [15] we studied a language construct restrict that allows programmers to specify that certain pointers are not aliased to other pointers used within a lexical scope....