Sciweavers

2629 search results - page 278 / 526
» complex 2009
Sort
View
126
Voted
SAT
2009
Springer
94views Hardware» more  SAT 2009»
15 years 11 months ago
Solving SAT for CNF Formulas with a One-Sided Restriction on Variable Occurrences
In this paper we consider the class of boolean formulas in Conjunctive Normal Form (CNF) where for each variable all but at most d occurrences are either positive or negative. This...
Daniel Johannsen, Igor Razgon, Magnus Wahlströ...
GLOBECOM
2009
IEEE
15 years 9 months ago
Multi-Path Key Establishment against REM Attacks in Wireless Ad Hoc Networks
Secure communications in wireless ad hoc networks require setting up end-to-end secret keys for communicating node pairs. Due to physical limitations and scalability requirements, ...
Tian Lan, Ruby B. Lee, Mung Chiang
158
Voted
DLOG
2009
15 years 2 months ago
A Combination of Boolean Games with Description Logics for Automated Multi-Attribute Negotiation
Abstract. Multi-attribute negotiation has been extensively studied from a gametheoretic viewpoint. In negotiation settings, utility functions are used to express agent preferences....
Thomas Lukasiewicz, Azzurra Ragone
CVPR
2009
IEEE
17 years 11 days ago
Reconstructing Sharply Folding Surfaces: A Convex Formulation
In recent years, 3D deformable surface reconstruction from single images has attracted renewed interest. It has been shown that preventing the surface from either shrinking or s...
Mathieu Salzmann (University of California, Berkel...
PODC
2009
ACM
16 years 5 months ago
A distributed polylogarithmic time algorithm for self-stabilizing skip graphs
Peer-to-peer systems rely on scalable overlay networks that enable efficient routing between its members. Hypercubic topologies facilitate such operations while each node only nee...
Riko Jacob, Andréa W. Richa, Christian Sche...