1723 search results - page 253 / 345 » Cycling in linear programming problems |
STACS
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. The problem of Subgraph Isomorphism is defined as follows: Given a pattern H and a host graph G on n vertices, does G contain a subgraph that is isomorphic to H? Eppstei...
INFOCOM
2009
IEEE
15 years 4 months ago
2009
IEEE
—We develop diverse routing schemes for dealing with multiple, possibly correlated, failures. While disjoint path protection can effectively deal with isolated single link failur...
CP
2007
Springer
15 years 3 months ago
2007
Springer
Motivated by the performance improvements made to SAT solvers in recent years, a number of different encodings of constraints into SAT have been proposed. Concrete examples are th...
AAAI
2006
14 years 11 months ago
2006
Partially observable Markov decision processes (POMDPs) are an intuitive and general way to model sequential decision making problems under uncertainty. Unfortunately, even approx...
SJ
2010
14 years 4 months ago
2010
We study the upgrading problem of existing Passive Optical Networks (PONs) that need to increase their capacity at different points in time. Our method upgrades line rates and migr...