Sciweavers

1253 search results - page 182 / 251
» Convergence of Evolutionary Algorithms in General Search Spa...
Sort
View
JSAC
2008
140views more  JSAC 2008»
15 years 6 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
PIMRC
2008
IEEE
16 years 20 days ago
A joint routing-MAC model for cellular-relaying networks
—We present an iterative joint scheduling-routing algorithm for characterizing the long-term performance of a cellular-relaying network. The physical layer model is based on idea...
Bogdan Timus, Pablo Soldati
ECAI
2004
Springer
15 years 11 months ago
Improving Asynchronous Backtracking for Dealing with Complex Local Problems
Distributed constraint satisfaction, in its most general acceptation, involves a collection of agents solving local constraint satisfaction subproblems, and a communication protoco...
Arnold Maestre, Christian Bessière
SIGMOD
2009
ACM
219views Database» more  SIGMOD 2009»
16 years 6 months ago
Hermes: a travel through semantics on the data web
The Web as a global information space is developing from a Web of documents to a Web of data. This development opens new ways for addressing complex information needs. Search is n...
Haofen Wang, Thomas Penin, Kaifeng Xu, Junquan Che...
CORR
2011
Springer
197views Education» more  CORR 2011»
15 years 1 months ago
Query Expansion Based on Clustered Results
Query expansion is a functionality of search engines that suggests a set of related queries for a user-issued keyword query. Typical corpus-driven keyword query expansion approach...
Ziyang Liu, Sivaramakrishnan Natarajan, Yi Chen