Sciweavers

3471 search results - page 585 / 695
» Obstacle Numbers of Graphs
Sort
View
4OR
2010
137views more  4OR 2010»
15 years 5 months ago
Extended formulations in combinatorial optimization
This survey is concerned with the size of perfect formulations for combinatorial optimization problems. By "perfect formulation", we mean a system of linear inequalities...
Michele Conforti, Gérard Cornuéjols,...
177
Voted
AI
2010
Springer
15 years 5 months ago
Understanding the scalability of Bayesian network inference using clique tree growth curves
Bayesian networks (BNs) are used to represent and ef ciently compute with multi-variate probability distributions in a wide range of disciplines. One of the main approaches to per...
Ole J. Mengshoel
141
Voted
AI
2007
Springer
15 years 5 months ago
Computational properties of argument systems satisfying graph-theoretic constraints
One difficulty that arises in abstract argument systems is that many natural questions regarding argument acceptability are, in general, computationally intractable having been c...
Paul E. Dunne
164
Voted
JUCS
2006
117views more  JUCS 2006»
15 years 5 months ago
Resource Efficient Maintenance of Wireless Network Topologies
Abstract: Multiple hop routing in mobile ad hoc networks can minimize energy consumption and increase data throughput. Yet, the problem of radio interferences remain. However if th...
Tamás Lukovszki, Christian Schindelhauer, K...
148
Voted
TON
2010
152views more  TON 2010»
15 years 3 months ago
1 + N network protection for mesh networks: network coding-based protection using p-cycles
—p-Cycles have been proposed for preprovisioned 1 : N protection in optical mesh networks. Although the protection circuits are preconfigured, the detection of failures and the ...
Ahmed E. Kamal