Sciweavers

9719 search results - page 1511 / 1944
» Answer Set Optimization
Sort
View
SIGECOM
2003
ACM
122views ECommerce» more  SIGECOM 2003»
16 years 4 days ago
On polynomial-time preference elicitation with value queries
Preference elicitation — the process of asking queries to determine parties’ preferences — is a key part of many problems in electronic commerce. For example, a shopping age...
Martin Zinkevich, Avrim Blum, Tuomas Sandholm
CP
2003
Springer
16 years 3 days ago
Incremental Computation of Resource-Envelopes in Producer-Consumer Models
Abstract. Interleaved planning and scheduling employs the idea of extending partial plans by regularly heeding to the scheduling constraints during search. One of the techniques us...
T. K. Satish Kumar
BIBM
2009
IEEE
172views Bioinformatics» more  BIBM 2009»
15 years 12 months ago
Identifying Gene Signatures from Cancer Progression Data Using Ordinal Analysis
—A comprehensive understanding of cancer progression may shed light on genetic and molecular mechanisms of oncogenesis, and it may provide much needed information for effective d...
Yoon Soo Pyon, Jing Li
CF
2010
ACM
15 years 12 months ago
Variant-based competitive parallel execution of sequential programs
Competitive parallel execution (CPE) is a simple yet attractive technique to improve the performance of sequential programs on multi-core and multi-processor systems. A sequential...
Oliver Trachsel, Thomas R. Gross
FUN
2010
Springer
293views Algorithms» more  FUN 2010»
15 years 11 months ago
Computational Complexity of Two-Dimensional Platform Games
Abstract. We analyze the computational complexity of various twodimensional platform games. We identify common properties of these games that allow us to state several meta-theorem...
Michal Forisek
« Prev « First page 1511 / 1944 Last » Next »