4451 search results - page 405 / 891 » On Random Ordering Constraints |
194
click to vote
SODA
2012
ACM
13 years 9 months ago
2012
ACM
The Densest k-subgraph problem (i.e. find a size k subgraph with maximum number of edges), is one of the notorious problems in approximation algorithms. There is a significant g...
167
click to vote
VLDB
2001
ACM
15 years 11 months ago
2001
ACM
This paper investigates the problem of incremental joins of multiple ranked data sets when the join condition is a list of arbitrary user-defined predicates on the input tuples. ...
191
click to vote
HEURISTICS
2010
15 years 4 months ago
2010
This paper investigates an adaptive constructive method for solving nurse rostering problems. The constraints considered in the problems are categorised into three classes: those t...
263
click to vote
Publication
Global logistics flows have increased dramatically in recent years due to the globalization in the world economy. It is more complex than the domestic logistics, consisting of mult...
253
click to vote
ICCV
1999
IEEE
16 years 8 months ago
1999
IEEE
We present an algorithm that extracts curves from a set of edgels within a specific class in a decreasing order of their ``length''. The algorithm inherits the perceptual...