We discuss the parallelization of algorithms for solving polynomial systems symbolically by way of triangular decompositions. We introduce a component-level parallelism for which ...
With impressive progress in Boolean Satisfiability (SAT) solving and several extensions to pseudo-Boolean (PB) constraints, many applications that use SAT, such as highperformanc...
Fadi A. Aloul, Arathi Ramani, Igor L. Markov, Kare...
We advocate the notion of service overlay network (SON) as an effective means to address some of the issues, in particular, end-to-end QoS, plaguing the current Internet, and to f...
Abstract— In this paper, we address the problem of determining an optimal topology for Bluetooth Wireless Personal Area Networks (BT-WPANs). In BT-WPANs, multiple communication c...
Marco Ajmone Marsan, Carla-Fabiana Chiasserini, An...
Interval computations estimate the uncertainty of the result of data processing in situations in which we only know the upper bounds ∆ on the measurement errors. In this case, ba...