3082 search results - page 190 / 617 » New Bounds for the Controller Problem |
115
click to vote
ECSCW
2001
15 years 6 months ago
2001
This paper seeks to inform the ongoing redesign of air traffic management by examining current practices and the adoption of a new system aiming to relieve traffic control from wor...
129
click to vote
IJCAI
2007
15 years 6 months ago
2007
Caching, symmetries, and search with decomposition are powerful techniques for pruning the search space of constraint problems. In this paper we present an innovative way of effi...
143
click to vote
AAECC
2005
Springer
15 years 4 months ago
2005
Springer
Abstract We consider a polynomial analogue of the hidden number problem introduced by Boneh andVenkatesan, namely the sparse polynomial noisy interpolation problem of recovering an...
173
click to vote
CPAIOR
2011
Springer
14 years 8 months ago
2011
Springer
Abstract. We study the application of limited-width MDDs (multivalued decision diagrams) as discrete relaxations for combinatorial optimization problems. These relaxations are used...
128
click to vote
CDC
2009
IEEE
15 years 5 months ago
2009
IEEE
In this paper, we study the reachability problem for the class of (strictly) monotone Petri nets that we define based on algebraic conditions. More specifically, given a (strictly)...