363 search results - page 43 / 73 » Partial Multicuts in Trees |
CLUSTER
2005
IEEE
14 years 3 months ago
2005
IEEE
Data intensive applications on clusters often require requests quickly be sent to the node managing the desired data. In many applications, one must look through a sorted tree str...
FCCM
1999
IEEE
14 years 2 months ago
1999
IEEE
This paper presents a method, called multiple constant multiplier trees MCMTs, for producing optimized recon gurable hardware implementations of vector products. An algorithm for ...
WSC
2008
14 years 6 days ago
2008
We present an improved sweep metaheuristic for discrete event simulation optimization. The sweep algorithm is a tree search similar to beam search. The basic idea is to run a limi...
FUIN
2007
13 years 9 months ago
2007
Abstract. In the paper two notions related to local (distributed) computations are identified and discussed. The first one is the notion of reducible graphs. A graph is reducible...
ATAL
2011
Springer
12 years 10 months ago
2011
Springer
The main goal of a persuasion dialogue is to persuade, but agents may have a number of additional goals concerning the dialogue duration, how much and what information is shared o...