Sciweavers

5316 search results - page 369 / 1064
» Which Search Problems Are Random
Sort
View
CORR
2011
Springer
160views Education» more  CORR 2011»
14 years 11 months ago
Searching for Bayesian Network Structures in the Space of Restricted Acyclic Partially Directed Graphs
Although many algorithms have been designed to construct Bayesian network structures using different approaches and principles, they all employ only two methods: those based on i...
Silvia Acid, Luis M. de Campos
HEURISTICS
2002
152views more  HEURISTICS 2002»
15 years 7 months ago
A Constraint-Based Method for Project Scheduling with Time Windows
This paper presents a heuristic algorithm for solving RCPSP/max, the resource constrained project scheduling problem with generalized precedence relations. The algorithm relies, a...
Amedeo Cesta, Angelo Oddi, Stephen F. Smith
186
Voted
SIAMJO
2008
72views more  SIAMJO 2008»
15 years 7 months ago
A Sample Approximation Approach for Optimization with Probabilistic Constraints
We study approximations of optimization problems with probabilistic constraints in which the original distribution of the underlying random vector is replaced with an empirical dis...
James Luedtke, Shabbir Ahmed
IPPS
2005
IEEE
16 years 1 months ago
Optimal Oblivious Path Selection on the Mesh
— In the oblivious path selection problem, each packet in the network independently chooses a path, which is an important property if the routing algorithm is to be independent o...
Costas Busch, Malik Magdon-Ismail, Jing Xi
229
Voted
WWW
2008
ACM
16 years 8 months ago
Online learning from click data for sponsored search
Sponsored search is one of the enabling technologies for today's Web search engines. It corresponds to matching and showing ads related to the user query on the search engine...
Massimiliano Ciaramita, Vanessa Murdock, Vassilis ...