1736 search results - page 325 / 348 » On antimagic directed graphs |
CAL
2006
13 years 8 months ago
2006
Instruction-level traces are widely used for program and hardware analysis. However, program traces for just a few seconds of execution are enormous, up to several terabytes in siz...
CONSTRAINTS
2006
13 years 8 months ago
2006
Abstract. Constraint Programming (CP) offers a rich modeling language of constraints embedding efficient algorithms to handle complex and heterogeneous combinatorial problems. To s...
IJAR
2008
13 years 8 months ago
2008
This paper presents a family of algorithms for approximate inference in credal networks (that is, models based on directed acyclic graphs and set-valued probabilities) that contai...
COR
2007
13 years 8 months ago
2007
We present new primal-dual algorithms for several network design problems. The problems considered are the generalized Steiner tree problem (GST), the directed Steiner tree proble...
JSW
2008
13 years 8 months ago
2008
Service composition is emerging as an important paradigm for constructing distributed applications by combining and reusing independently developed component services. One key issu...