Sciweavers

1963 search results - page 374 / 393
» The Maximum Solution Problem on Graphs
Sort
View
JSA
1998
72views more  JSA 1998»
13 years 9 months ago
Network conscious design of distributed real-time systems
In this paper, we present a network conscious approach to designing distributed real-time systems. Given a task graph design of the system, the end-to-end constraints on the input...
Jung Woo Park, Young Shin Kim, Seongsoo Hong, Mana...
FUIN
2010
112views more  FUIN 2010»
13 years 8 months ago
An Empirical Study of QBF Encodings: from Treewidth Estimation to Useful Preprocessing
From an empirical point of view, the hardness of quantified Boolean formulas (QBFs), can be characterized by the (in)ability of current state-of-the-art QBF solvers to decide abo...
Luca Pulina, Armando Tacchella
PERCOM
2010
ACM
13 years 8 months ago
Gateway designation for timely communications in instant mesh networks
In this paper, we explore how to effectively create and use "instant mesh networks", i.e., wireless mesh networks that are dynamically deployed in temporary circumstances...
Bo Xing, Mayur Deshpande, Sharad Mehrotra, Nalini ...
IFIPTM
2009
109views Management» more  IFIPTM 2009»
13 years 7 months ago
Elimination of Subjectivity from Trust Recommendation
In many distributed applications, a party who wishes to make a transaction requires that it has a certain level of trust in the other party. It is frequently the case that the part...
Omar Hasan, Lionel Brunie, Jean-Marc Pierson, Elis...
EJWCN
2010
115views more  EJWCN 2010»
13 years 4 months ago
Efficient Certification Path Discovery for MANET
A Mobile Ad Hoc Network (MANET) is characterized by the lack of any infrastructure, absence of any kind of centralized administration, frequent mobility of nodes, network partitio...
Georgios Kambourakis, Elisavet Konstantinou, Anast...