1493 search results - page 201 / 299 » Local resilience of graphs |
APVIS
2001
13 years 9 months ago
2001
Traditional graph drawing is only concerned with viewing of data and relations amount data items. It uses a graph model to present the data items and the relations and tries to ca...
DAGSTUHL
1996
13 years 9 months ago
1996
An analysis method for specialization of imperative programs is described in this paper. This analysis is an inter-procedural data flow method operating on control flow graphs and...
DISOPT
2010
13 years 8 months ago
2010
We consider labeled Traveling Salesman Problems, defined upon a complete graph of n vertices with colored edges. The objective is to find a tour of maximum or minimum number of co...
JMLR
2006
13 years 8 months ago
2006
In this article we describe a set of scalable techniques for learning the behavior of a group of agents in a collaborative multiagent setting. As a basis we use the framework of c...
HIPEAC
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. Stream programming is a promising way to expose concurrency to the compiler. A stream program is built from kernels that communicate only via point-to-point streams. The ...