1064 search results - page 136 / 213 » Exact Algorithms for the Quadratic Linear Ordering Problem |
105
click to vote
ICDE
2010
IEEE
16 years 4 months ago
2010
IEEE
Abstract-- We consider the Top-k Approximate Subtree Matching (TASM) problem: finding the k best matches of a small query tree, e.g., a DBLP article with 15 nodes, in a large docum...
124
click to vote
CORR
2008
Springer
15 years 3 months ago
2008
Springer
Abstract. The group isomorphism problem asks whether two given groups are isomorphic or not. Whereas the case where both groups are abelian is well understood and can be solved eff...
125
click to vote
STOC
1997
ACM
15 years 8 months ago
1997
ACM
For a large class of examples arising in statistical physics known as attractive spin systems (e.g., the Ising model), one seeks to sample from a probability distribution π on an...
131
click to vote
IOR
2010
15 years 2 months ago
2010
In many applications involving make-to-order or time-sensitive (e.g., perishable, seasonal) products, finished orders are often delivered to customers immediately or shortly after...
144
click to vote
QEST
2008
IEEE
15 years 10 months ago
2008
IEEE
In [3] a probabilistic semantics for timed automata has been defined in order to rule out unlikely (sequences of) events. The qualitative model-checking problem for LTL propertie...