Sciweavers

604 search results - page 119 / 121
» On the Complexity of the Maximum Cut Problem
Sort
View
WOWMOM
2005
ACM
184views Multimedia» more  WOWMOM 2005»
14 years 1 months ago
ALCA: A New Scheme for Power Control on 802.11 Ad Hoc Networks
— This paper presents the ALCA (Asymmetric Link Collision Avoidance) protocol. ALCA was designed to deal with a known deficiency of the Basic Scheme [1] for power control in 802...
Alexandre Andrade Pires, José Ferreira de R...
CHARME
2005
Springer
94views Hardware» more  CHARME 2005»
14 years 1 months ago
Verifying Quantitative Properties Using Bound Functions
Abstract. We define and study a quantitative generalization of the traditional boolean framework of model-based specification and verification. In our setting, propositions have...
Arindam Chakrabarti, Krishnendu Chatterjee, Thomas...
SPAA
2010
ACM
14 years 10 days ago
Securing every bit: authenticated broadcast in radio networks
This paper studies non-cryptographic authenticated broadcast in radio networks subject to malicious failures. We introduce two protocols that address this problem. The first, Nei...
Dan Alistarh, Seth Gilbert, Rachid Guerraoui, Zark...
FAST
2008
13 years 10 months ago
Improving I/O Performance of Applications through Compiler-Directed Code Restructuring
Ever-increasing complexity of large-scale applications and continuous increases in sizes of the data they process make the problem of maximizing performance of such applications a...
Mahmut T. Kandemir, Seung Woo Son, Mustafa Karak&o...
IJCAI
1997
13 years 9 months ago
Mini-Buckets: A General Scheme for Generating Approximations in Automated Reasoning
The class of algorithms for approximating reasoning tasks presented in this paper is based on approximating the general bucket elimination framework. The algorithms have adjustabl...
Rina Dechter