692 search results - page 98 / 139 » BDD minimization for approximate computing |
CN
2004
14 years 10 months ago
2004
Distributed Web-server systems have been widely used to provide effective Internet services. The management of these systems requires dynamic controls of the Web traffic. With the...
SIGMETRICS
2002
ACM
14 years 10 months ago
2002
ACM
It is well known that optimal server placement is NP-hard. We present an approximate model for the case when both clients and servers are dense, and propose a simple server alloca...
159
click to vote
ECCC
2011
14 years 5 months ago
2011
In recent results the complexity of isomorphism testing on graphs of bounded treewidth is improved to TC1 [GV06] and further to LogCFL [DTW10]. The computation of canonical forms ...
DCOSS
2009
Springer
15 years 5 months ago
2009
Springer
Abstract. The optimal allocation of samples for activity-level detection in a wireless body area network for health-monitoring applications is considered. A wireless body area netw...
91
Voted
JGO
2010
14 years 5 months ago
2010
The best known method to find exact or at least -approximate solutions to polynomial programming problems is the spatial Branch-and-Bound algorithm, which rests on computing lower...