1132 search results - page 219 / 227 » Upper and lower Ramsey bounds in bounded arithmetic |
SIGECOM
2009
ACM
14 years 1 months ago
2009
ACM
Voting trees describe an iterative procedure for selecting a single vertex from a tournament. vide a very general abstract model of decision-making among a group of individuals, a...
HICSS
2007
IEEE
14 years 1 months ago
2007
IEEE
A key enabler of the recently adopted, assemblycentric development approach for distributed real-time software systems is QoS-enabled middleware, which provides reusable building ...
EMSOFT
2007
Springer
14 years 27 days ago
2007
Springer
Design space exploration of embedded systems typically focuses on classical design goals such as cost, timing, buffer sizes, and power consumption. Robustness criteria, i.e. sensi...
FSE
2007
Springer
14 years 27 days ago
2007
Springer
We investigate the security of n-bit to m-bit vectorial Boolean functions in stream ciphers. Such stream ciphers have higher throughput than those using single-bit output Boolean f...
HM
2007
Springer
14 years 26 days ago
2007
Springer
The connected facility location (ConFL) problem generalizes the facility location problem and the Steiner tree problem in graphs. Given a graph G = (V, E), a set of customers D ⊆...