Sciweavers

486 search results - page 48 / 98
» Expressing OLAP Preferences
Sort
View
ECCC
2008
108views more  ECCC 2008»
13 years 7 months ago
The Complexity of Rationalizing Matchings
Given a set of observed economic choices, can one infer preferences and/or utility functions for the players that are consistent with the data? Questions of this type are called r...
Shankar Kalyanaraman, Christopher Umans
FUIN
2010
137views more  FUIN 2010»
13 years 5 months ago
Extending and Implementing RASP
In previous work we have proposed an extension to ASP (Answer Set Programming), called RASP, standing for ASP with Resources. RASP supports declarative reasoning on production and...
Stefania Costantini, Andrea Formisano, Davide Pett...
CSB
2005
IEEE
126views Bioinformatics» more  CSB 2005»
14 years 1 months ago
Identifying Simple Discriminatory Gene Vectors with an Information Theory Approach
In the feature selection of cancer classification problems, many existing methods consider genes individually by choosing the top genes which have the most significant signal-to...
Zheng Yun, Kwoh Chee Keong
ESA
2007
Springer
143views Algorithms» more  ESA 2007»
14 years 1 months ago
Two's Company, Three's a Crowd: Stable Family and Threesome Roommates Problems
We investigate Knuth’s eleventh open question on stable matchings. In the stable family problem, sets of women, men, and dogs are given, all of whom state their preferences among...
Chien-Chung Huang
SIGECOM
2005
ACM
90views ECommerce» more  SIGECOM 2005»
14 years 1 months ago
ICE: an iterative combinatorial exchange
We present the first design for a fully expressive iterative combinatorial exchange (ICE). The exchange incorporates a tree-based bidding language that is concise and expressive ...
David C. Parkes, Ruggiero Cavallo, Nick Elprin, Ad...