515 search results - page 33 / 103 » A Reduced Complexity Algorithm for Minimizing N-Detect Tests |
CONEXT
2008
ACM
13 years 10 months ago
2008
ACM
In peer-to-peer (P2P) systems, a receiver needs to be matched with multiple senders, because peers have limited capacity and reliability. Efficient peer matching can reduce the co...
LATA
2009
Springer
14 years 3 months ago
2009
Springer
We show that fixed membership testing for many interesting subclasses of multi-pushdown machines is no harder than for pushdowns with single stack. The models we consider are MVPA...
ICCMS
2009
13 years 6 months ago
2009
The simulation of chemical reacting systems is one of the most challenging topics in Systems Biology, due to their complexity and inherent randomness. The Gillespie's Stochas...
DAC
2009
ACM
14 years 9 months ago
2009
ACM
In this paper, we propose an effective algorithm flow to handle largescale mixed-size placement. The basic idea is to use floorplanning to guide the placement of objects at the gl...
EWCBR
2006
Springer
14 years 4 days ago
2006
Springer
Feature selection algorithms can reduce the high dimensionality of textual cases and increase case-based task performance. However, conventional algorithms (e.g., information gain)...