Sciweavers

469 search results - page 31 / 94
» Edges as Nodes - a New Approach to Timetable Information
Sort
View
SAC
2006
ACM
14 years 1 months ago
Trust-decisions on the base of maximal information of recommended direct-trust
Nowadays the concept of trust in computer communications starts to get more and more popular. While the idea of trust in human interaction seems to be obvious and understandable i...
Uwe Roth, Volker Fusenig
STOC
2001
ACM
104views Algorithms» more  STOC 2001»
14 years 8 months ago
Spatial gossip and resource location protocols
The dynamic behavior of a network in which information is changing continuously over time requires robust and efficient mechanisms for keeping nodes updated about new information. ...
David Kempe, Jon M. Kleinberg, Alan J. Demers
LCN
2007
IEEE
14 years 1 months ago
Detecting Black Hole Attacks in Tactical MANETs using Topology Graphs
Abstract— Black Hole Attacks are a serious threat to communication in tactical MANETs. In this work we present TOGBAD a new centralised approach, using topology graphs to identif...
Elmar Gerhards-Padilla, Nils Aschenbruck, Peter Ma...
CIT
2004
Springer
14 years 1 months ago
Associativity Based Mobility-Adaptive K-Clustering in Mobile Ad-Hoc Networks
To solve the scalability issue of ad hoc network, a new cluster maintenance protocol is proposed. Clusters may change dynamically, reflecting the mobility of the underlying networ...
Chinnappan Jayakumar, Chenniappan Chellappan
CP
2003
Springer
14 years 27 days ago
Using Constraint Programming to Solve the Maximum Clique Problem
This paper aims to show that Constraint Programming can be an efficient technique to solve a well-known combinatorial optimization problem: the search for a maximum clique in a gra...
Jean-Charles Régin