729 search results - page 104 / 146 » Solving subgraph isomorphism problems with constraint progra... |
126
Voted
HYBRID
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. We consider the problem of security constrained optimal control for discrete-time, linear dynamical systems in which control and measurement packets are transmitted over ...
127
click to vote
ICTAI
1999
IEEE
15 years 8 months ago
1999
IEEE
Recently, there has been much interest in enhancing purely combinatorial formalisms with numerical information. For example, planning formalisms can be enriched by taking resource...
142
click to vote
AI
1999
Springer
15 years 3 months ago
1999
Springer
Bucket elimination is an algorithmic framework that generalizes dynamic programming to accommodate many problem-solving and reasoning tasks. Algorithms such as directional-resolut...
135
click to vote
NIPS
2008
15 years 5 months ago
2008
We propose a new class of consistency constraints for Linear Programming (LP) relaxations for finding the most probable (MAP) configuration in graphical models. Usual cluster-base...
162
Voted
PLANX
2007
15 years 5 months ago
2007
We present an algorithm to solve XPath decision problems under regular tree type constraints and show its use to statically typecheck XPath queries. To this end, we prove the deci...