3008 search results - page 499 / 602 » Independence in connected graphs |
178
click to vote
APPROX
2006
Springer
15 years 10 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...
184
click to vote
APSEC
2003
IEEE
15 years 10 months ago
2003
IEEE
Today, the syntax of visual specification languages such as UML is typically defined using meta-modelling techniques. However, this kind of syntax definition has drawbacks. In par...
166
click to vote
AIPS
2008
15 years 9 months ago
2008
Planning as heuristic search is a powerful approach to solving domain independent planning problems. In recent years, various successful heuristics and planners like FF, LPG, FAST...
188
click to vote
ICALP
2010
Springer
15 years 9 months ago
2010
Springer
Abstract. Given a family of subsets of an n-element universe, the kcover problem asks whether there are k sets in the family whose union contains the universe; in the k-packing pro...
195
click to vote
CAV
2008
Springer
15 years 9 months ago
2008
Springer
Hangal et. al. [3] have developed a procedure to check if an instance of the execution of a shared memory multiprocessor program, is consistent with the Total Store Order (TSO) mem...