3082 search results - page 64 / 617 » New Bounds for the Controller Problem |
140
click to vote
CPAIOR
2010
Springer
15 years 8 months ago
2010
Springer
We present a new method to compute upper bounds of the number of solutions of binary integer programming (BIP) problems. Given a BIP, we create a dynamic programming (DP) table for...
136
click to vote
PR
2008
15 years 3 months ago
2008
Feature set partitioning generalizes the task of feature selection by partitioning the feature set into subsets of features that are collectively useful, rather than by finding a ...
128
click to vote
HYBRID
1999
Springer
15 years 8 months ago
1999
Springer
Abstract. One of the most important analysis problems of hybrid systems is the reachability problem. State of the art computational tools perform reachability computation for timed...
146
click to vote
RTSS
2007
IEEE
15 years 10 months ago
2007
IEEE
Schedulability analysis is a cornerstone of modern real-time scheduling theory development. Utilizationbound based schedulability test is considered one of most efficient and effe...
134
click to vote
AAAI
2008
2008
Abduction with Bounded Treewidth: From Theoretical Tractability to Practically Efficient Computation
15 years 6 months ago
Abductive diagnosis is an important method to identify explanations for a given set of observations. Unfortunately, most of the algorithmic problems in this area are intractable. ...