Sciweavers

803 search results - page 137 / 161
» Independence in Direct-Product Graphs
Sort
View
APPROX
2006
Springer
120views Algorithms» more  APPROX 2006»
14 years 5 days ago
Single-Source Stochastic Routing
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...
Shuchi Chawla, Tim Roughgarden
APSEC
2003
IEEE
14 years 2 days ago
Rigorous EBNF-based Definition for a Graphic Modeling Language
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...
Yong Xia, Martin Glinz
SC
1991
ACM
13 years 12 months ago
A method of vector processing for shared symbolic data
Kanada, Y., A method of vector processing for shared symbolic data, Parallel Computing, X (1993) XXX-XXX. Conventional processing techniques for pipelined vector processors such a...
Yasusi Kanada
AIPS
2008
13 years 10 months ago
Useless Actions Are Useful
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...
Martin Wehrle, Sebastian Kupferschmid, Andreas Pod...
ICALP
2010
Springer
13 years 10 months ago
Covering and Packing in Linear Space
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...
Andreas Björklund, Thore Husfeldt, Petteri Ka...