1729 search results - page 308 / 346 » Bound Graph Polysemy |
135
click to vote
APPROX
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. We introduce and study the following model for routing uncertain demands through a network. We are given a capacitated multicommodity flow network with a single source an...
157
Voted
CSR
2006
Springer
15 years 8 months ago
2006
Springer
We propose a new model of restricted branching programs specific to solving GEN problems, which we call incremental branching programs. We show that syntactic incremental branchin...
133
click to vote
LICS
1997
IEEE
15 years 8 months ago
1997
IEEE
We consider a class of infinite two-player games on finitely coloured graphs. Our main question is: given a winning condition, what is the inherent blow-up (additional memory) of ...
132
click to vote
AAAI
2007
15 years 7 months ago
2007
The paper presents and evaluates the power of best-first search over AND/OR search spaces in graphical models. The main virtue of the AND/OR representation is its sensitivity to ...
165
Voted
AAAI
2007
15 years 7 months ago
2007
We present in this paper a hybrid planning system which combines constraint satisfaction techniques and planning heuristics to produce optimal sequential plans. It integrates its ...