1529 search results - page 16 / 306 » Search Space Analysis of the Linear Ordering Problem |
ICCD
2001
IEEE
14 years 4 months ago
2001
IEEE
Reduced Ordered Binary Decision Diagrams (BDDs) are a data structure for representation and manipulation of Boolean functions which are frequently used in VLSI Design Automation. ...
SODA
2010
ACM
14 years 5 months ago
2010
ACM
Many combinatorial problems--such as the traveling salesman, feedback arcset, cutwidth, and treewidth problem-can be formulated as finding a feasible permutation of n elements. Ty...
IMA
2007
Springer
14 years 1 months ago
2007
Springer
Non-linear cryptanalysis is a natural extension to Matsui’s linear cryptanalitic techniques in which linear approximations are replaced by nonlinear expressions. Non-linear appro...
ICML
2004
IEEE
14 years 8 months ago
2004
IEEE
Conditional Random Fields (CRFs; Lafferty, McCallum, & Pereira, 2001) provide a flexible and powerful model for learning to assign labels to elements of sequences in such appl...
EPS
1998
Springer
13 years 11 months ago
1998
Springer
The task of finding minimal elements of a partially ordered set is a generalization of the task of finding the global minimum of a real-valued function or of finding Pareto-optimal...