1456 search results - page 30 / 292 » Improved Randomized Results for That Interval Selection Prob... |
JAL
2008
14 years 10 months ago
2008
An important class of heuristics for constraint satisfaction problems works by sampling information during search in order to inform subsequent decisions. One of these strategies, ...
COR
2007
14 years 9 months ago
2007
We studied a supplier selection problem, where a buyer, while facing random demand, is to decide ordering quantities from a set of suppliers with different yields and prices.We pr...
JMLR
2010
14 years 4 months ago
2010
An algorithm is presented for topology selection in graphical models of autoregressive Gaussian time series. The graph topology of the model represents the sparsity pattern of the...
PR
2006
14 years 10 months ago
2006
A conventional way to discriminate between objects represented by dissimilarities is the nearest neighbor method. A more efficient and sometimes a more accurate solution is offere...
119
click to vote
CONSTRAINTS
1998
14 years 9 months ago
1998
Many temporal applications like planning and scheduling can be viewed as special cases of the numeric and symbolic temporal constraint satisfaction problem. Thus we have developed ...