461 search results - page 28 / 93 » Splitting NP-Complete Sets |
WSC
2008
14 years 1 months ago
2008
In this study we propose a new method for designing computer experiments inspired by the split plot designs used in physical experimentation. The basic layout is that each set of ...
INFOCOM
2009
IEEE
14 years 5 months ago
2009
IEEE
—During the past decade, the packet classification problem has been widely studied to accelerate network applications such as access control, traffic engineering and intrusion de...
SAC
2005
ACM
14 years 4 months ago
2005
ACM
: This paper presents a system for induction of forest of functional trees from data streams able to detect concept drift. The Ultra Fast Forest of Trees (UFFT) is an incremental a...
CSCW
2000
ACM
14 years 3 months ago
2000
ACM
WebSplitter symbolizes the union of pervasive multi-device computing and collaborative multi-user computing. WebSplitter provides a unified XML framework that enables multi-device...
PPOPP
1997
ACM
14 years 3 months ago
1997
ACM
Global addressing of shared data simplifies parallel programming and complements message passing models commonly found in distributed memory machines. A number of programming sys...