Sciweavers

8141 search results - page 194 / 1629
» Higher Order Generalization
Sort
View
ATAL
2006
Springer
15 years 7 months ago
Strategic voting when aggregating partially ordered preferences
Preferences of a single agent are often partially ordered. For example, it may be hard to compare a novel with a biography. In such a situation, the agent may want the novel and t...
Maria Silvia Pini, Francesca Rossi, Kristen Brent ...
SAC
2008
ACM
15 years 3 months ago
Total order broadcast on pervasive systems
Total Order Broadcast protocols are important tools to ensure coherence across distributed systems. Contrarily to classical distributed systems, pervasive systems bring important ...
Luiz Angelo Steffenel, Manuele Kirsch-Pinheiro, Yo...
RECOMB
2005
Springer
16 years 4 months ago
Lower Bounds for Maximum Parsimony with Gene Order Data
Abstract. In this paper, we study lower bound techniques for branchand-bound algorithms for maximum parsimony, with a focus on gene order data. We give a simple O(n3 ) time dynamic...
Abraham Bachrach, Kevin Chen, Chris Harrelson, Rad...
NOSSDAV
2005
Springer
15 years 9 months ago
Using n-trees for scalable event ordering in peer-to-peer games
We are concerned with the fundamental problem of event ordering in multiplayer peer-to-peer games. Event ordering, even without faults, requires all-to-all message passing with at...
Chris GauthierDickey, Virginia Mary Lo, Daniel Zap...
SDM
2010
SIAM
191views Data Mining» more  SDM 2010»
15 years 5 months ago
Active Ordering of Interactive Prediction Tasks
Many applications involve a set of prediction tasks that must be accomplished sequentially through user interaction. If the tasks are interdependent, the order in which they are p...
Abhimanyu Lad, Yiming Yang