3082 search results - page 346 / 617 » New Bounds for the Controller Problem |
163
click to vote
SIGIR
1992
ACM
15 years 10 months ago
1992
ACM
Our previous research on one-probe access to large collections of data indexed by alphanumeric keys has produced the first practical minimal perfect hash functions for this proble...
186
click to vote
ESOP
2009
Springer
15 years 10 months ago
2009
Springer
This paper studies inductive definitions involving binders, in which aliasing between free and bound names is permitted. Such aliasing occurs in informal specifications of operatio...
168
click to vote
COMPGEOM
2001
ACM
15 years 10 months ago
2001
ACM
This paper addresses the problem of lossy compression of arrangements. Given an arrangement of n lines in the plane, we show how to construct another arrangement consisting of man...
188
click to vote
WSC
2007
15 years 9 months ago
2007
Simulation optimization (SO) is the process of finding the optimum design of a system whose performance measure(s) are estimated via simulation. We propose some ideas to improve o...
159
Voted
IJCAI
2007
15 years 8 months ago
2007
Hypertree decomposition has been shown to be the most general CSP decomposition method. However, so far the exact methods are not able to find optimal hypertree decompositions of...