Sciweavers

1671 search results - page 299 / 335
» On the Covering Steiner Problem
Sort
View
JSAC
2008
140views more  JSAC 2008»
13 years 11 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
TCS
2008
13 years 11 months ago
Self-deployment of mobile sensors on a ring
Mobile sensors can self-deploy in a purely decentralized and distributed fashion, so to reach in finite time a state of static equilibrium in which they cover uniformly the enviro...
Paola Flocchini, Giuseppe Prencipe, Nicola Santoro
JETAI
2007
131views more  JETAI 2007»
13 years 11 months ago
A computational architecture for heterogeneous reasoning
Reasoning, problem solving, indeed the general process of acquiring knowledge, is not an isolated, homogenous affair involving a one agent using a single form of representation, b...
Dave Barker-Plummer, John Etchemendy
SIAMCOMP
1998
125views more  SIAMCOMP 1998»
13 years 10 months ago
Free Bits, PCPs, and Nonapproximability-Towards Tight Results
This paper continues the investigation of the connection between probabilistically checkable proofs (PCPs) and the approximability of NP-optimization problems. The emphasis is on p...
Mihir Bellare, Oded Goldreich, Madhu Sudan
ISI
2008
Springer
13 years 9 months ago
Intelligent pattern recognition and biometrics
This talk deals with advanced concepts of Artificial Intelligence (AI) and Pattern Recognition (PR), and their applications to solving real life problems including biometrics appl...
P. Wang