1204 search results - page 145 / 241 » Hybrid Probabilistic Programs |
113
Voted
HEURISTICS
2002
15 years 18 days ago
2002
This paper presents operators searching large neighborhoods in order to solve the vehicle routing problem. They make use of the pruning and propagation techniques of constraint pr...
101
Voted
ECAI
2010
Springer
14 years 11 months ago
2010
Springer
A soft global constraint SOFTPREC has been proposed recently for solving optimisation problems involving precedence relations. In this paper we present new pruning rules for this g...
118
Voted
TREC
2003
15 years 2 months ago
2003
Ranking functions are instrumental for the success of an information retrieval (search engine) system. However nearly all existing ranking functions are manually designed based on...
100
click to vote
CORR
2010
Springer
15 years 28 days ago
2010
Springer
Abstract--In cognitive radio (CR) networks with multipleinput multiple-output (MIMO) links, secondary users (SUs) can exploit "spectrum holes" in the space domain to acce...
121
Voted
EOR
2010
15 years 27 days ago
2010
Abstract: Probabilistically constrained problems, in which the random variables are finitely distributed, are nonconvex in general and hard to solve. The p-efficiency concept has b...