1101 search results - page 157 / 221 » An Algorithm for the Graph Crossing Number Problem |
124
Voted
CONCUR
2006
Springer
15 years 4 months ago
2006
Springer
In regular inference, the problem is to infer a regular language, typically represented by a deterministic finite automaton (DFA) from answers to a finite set of membership querie...
134
Voted
ESOP
2006
Springer
15 years 6 months ago
2006
Springer
We present and solve a path optimization problem on programs. Given a set of program nodes, called critical nodes, we find a shortest path through the program's control flow g...
156
Voted
PUK
2003
15 years 3 months ago
2003
This paper exploits the spatial representation of state space problem graphs to preprocess and enhance heuristic search engines. It combines classical AI exploration with computati...
128
Voted
COMBINATORICA
2008
15 years 2 months ago
2008
Let NF(n, k, r) denote the maximum number of columns in an n-row matrix with entries in a finite field F in which each column has at most r nonzero entries and every k columns are...
132
click to vote
ASPDAC
2006
ACM
15 years 8 months ago
2006
ACM
Abstract— Routing tree construction is a fundamental problem in modern VLSI design. In this paper we propose CDCTree, an Obstacle-Avoiding Rectilinear Steiner Minimum Tree (OARSM...