653 search results - page 65 / 131 » The size of minimum 3-trees |
177
click to vote
JGAA
2006
15 years 6 months ago
2006
We consider the problem of constructing a minimal cycle-breaking set of turns for a given undirected graph. This problem is important for deadlock-free wormhole routing in compute...
130
click to vote
COCO
2003
Springer
15 years 11 months ago
2003
Springer
We continue an investigation of resource-bounded Kolmogorov complexity and derandomization techniques begun in [2, 3]. We introduce nondeterministic time-bounded Kolmogorov comple...
165
click to vote
SODA
1998
ACM
15 years 7 months ago
1998
ACM
Consider the following file caching problem: in response to a sequence of requests for files, where each file has a specified size and retrieval cost, maintain a cache of files of ...
181
click to vote
ALIFE
2000
15 years 6 months ago
2000
We analyze a general model of multi-agent communication in which all agents communicate simultaneously to a message board. A genetic algorithm is used to evolve multi-agent languag...
181
click to vote
IWPEC
2009
Springer
16 years 26 days ago
2009
Springer
We study the Equitable Connected Partition problem, which is the problem of partitioning a graph into a given number of partitions, such that each partition induces a connected sub...