Sciweavers

7289 search results - page 1288 / 1458
» A Dependent Set Theory
Sort
View
CORR
2010
Springer
189views Education» more  CORR 2010»
13 years 7 months ago
An Optimal Dynamic Mechanism for Multi-Armed Bandit Processes
We consider the problem of revenue-optimal dynamic mechanism design in settings where agents' types evolve over time as a function of their (both public and private) experien...
Sham M. Kakade, Ilan Lobel, Hamid Nazerzadeh
PAA
2007
13 years 7 months ago
Pairwise feature evaluation for constructing reduced representations
Feature selection methods are often used to determine a small set of informative features that guarantee good classification results. Such procedures usually consist of two compon...
Artsiom Harol, Carmen Lai, Elzbieta Pekalska, Robe...
INFOCOM
2010
IEEE
13 years 6 months ago
Non-Preemptive Buffer Management for Latency Sensitive Packets
—The delivery of latency sensitive packets is a crucial issue in real time applications of communication networks. Such packets often have a firm deadline and a packet becomes u...
Moran Feldman, Joseph Naor
INFSOF
2010
113views more  INFSOF 2010»
13 years 6 months ago
Package Fingerprints: A visual summary of package interface usage
Context: Object-oriented languages such as Java, Smalltalk, and C++ structure their programs using packages. Maintainers of large systems need to understand how packages relate to...
Hani Abdeen, Stéphane Ducasse, Damien Polle...
IS
2010
13 years 6 months ago
Extracting a largest redundancy-free XML storage structure from an acyclic hypergraph in polynomial time
Given a hypergraph and a set of embedded functional dependencies, we investigate the problem of determining the conditions under which we can efficiently generate redundancy-free ...
Wai Yin Mok, Joseph Fong, David W. Embley
« Prev « First page 1288 / 1458 Last » Next »