Sciweavers

44651 search results - page 8555 / 8931
» Generalized
Sort
View
JSAC
2008
140views more  JSAC 2008»
15 years 7 months ago
Optimality and Complexity of Pure Nash Equilibria in the Coverage Game
In this paper, we investigate the coverage problem in wireless sensor networks using a game theory method. We assume that nodes are randomly scattered in a sensor field and the goa...
Xin Ai, Vikram Srinivasan, Chen-Khong Tham
JSAT
2008
99views more  JSAT 2008»
15 years 7 months ago
A Switching Criterion for Intensification and Diversification in Local Search for SAT
We propose a new switching criterion, namely the evenness or unevenness of the distribution of variable weights, and use this criterion to combine intensification and diversificat...
Wanxia Wei, Chu Min Li, Harry Zhang
JSAT
2008
122views more  JSAT 2008»
15 years 7 months ago
SAT Algorithms for Colouring Some Special Classes of Graphs: Some Theoretical and Experimental Results
The local search algorithm GSAT is based on the notion of Satisfiability. It has been used successfully for colouring graphs, solving instances of the 3SAT problem, planning block...
Sriyankar Acharyya
JCP
2006
90views more  JCP 2006»
15 years 7 months ago
Using LDA Method to Provide Mobile Location Estimation Services within a Cellular Radio Network
Abstract-- Mobile location estimation is becoming an important value-added service for a mobile phone operator. It is well-known that GPS can provide an accurate location estimatio...
Junyang Zhou, Joseph Kee-Yin Ng
JCS
2006
157views more  JCS 2006»
15 years 7 months ago
Analysis of probabilistic contract signing
We present three case studies, investigating the use of probabilistic model checking to automatically analyse properties of probabilistic contract signing protocols. We use the pr...
Gethin Norman, Vitaly Shmatikov
« Prev « First page 8555 / 8931 Last » Next »