Sciweavers

1254 search results - page 149 / 251
» Making Hard Problems Harder
Sort
View
AI
2006
Springer
13 years 10 months ago
Constraint-based optimization and utility elicitation using the minimax decision criterion
In many situations, a set of hard constraints encodes the feasible configurations of some system or product over which multiple users have distinct preferences. However, making su...
Craig Boutilier, Relu Patrascu, Pascal Poupart, Da...
SIGIR
2008
ACM
13 years 10 months ago
Learning to rank at query-time using association rules
Some applications have to present their results in the form of ranked lists. This is the case of many information retrieval applications, in which documents must be sorted accordi...
Adriano Veloso, Humberto Mossri de Almeida, Marcos...
SIGMETRICS
2008
ACM
175views Hardware» more  SIGMETRICS 2008»
13 years 10 months ago
DARC: dynamic analysis of root causes of latency distributions
OSprof is a versatile, portable, and efficient profiling methodology based on the analysis of latency distributions. Although OSprof has offers several unique benefits and has bee...
Avishay Traeger, Ivan Deras, Erez Zadok
IFE
2007
77views more  IFE 2007»
13 years 10 months ago
Drawing Subway Maps: A Survey
Abstract This paper deals with automating the drawing of subway maps. There are two features of schematic subway maps that make them different from drawings of other networks such...
Alexander Wolff
SIGMETRICS
2002
ACM
105views Hardware» more  SIGMETRICS 2002»
13 years 9 months ago
Modeling and analysis of dynamic coscheduling in parallel and distributed environments
Scheduling in large-scale parallel systems has been and continues to be an important and challenging research problem. Several key factors, including the increasing use of off-the...
Mark S. Squillante, Yanyong Zhang, Anand Sivasubra...