Sciweavers

6365 search results - page 1226 / 1273
» Fast Local Computation Algorithms
Sort
View
AAAI
1994
15 years 1 months ago
Solution Reuse in Dynamic Constraint Satisfaction Problems
Many AI problems can be modeled as constraint satisfaction problems (CSP), but many of them are actually dynamic: the set of constraints to consider evolves because of the environ...
Gérard Verfaillie, Thomas Schiex
87
Voted
ATAL
2010
Springer
15 years 1 months ago
Multi robotic exploration with communication requirement to a fixed base station
d Abstract) Piyoosh Mukhija IIIT Hyderabad Rahul Sawhney IIIT Hyderabad K Madhava Krishna IIIT Hyderabad We present an algorithm for multi robotic exploration of an unknown terrai...
Piyoosh Mukhija, Rahul Sawhney, K. Madhava Krishna
123
Voted
SIGCOMM
2010
ACM
15 years 23 days ago
An analysis of social network-based Sybil defenses
Recently, there has been much excitement in the research community over using social networks to mitigate multiple identity, or Sybil, attacks. A number of schemes have been propo...
Bimal Viswanath, Ansley Post, P. Krishna Gummadi, ...
96
Voted
ALIFE
2008
15 years 21 days ago
A Model of the Quorum Sensing System in Vibrio fischeri Using P Systems
Quorum sensing is a cell density dependent gene regulation system that allows an entire population of bacterial cells to communicate in order to regulate the expression of certain ...
Francisco José Romero-Campero, Mario J. P&e...
JUCS
2006
117views more  JUCS 2006»
15 years 15 days ago
Resource Efficient Maintenance of Wireless Network Topologies
Abstract: Multiple hop routing in mobile ad hoc networks can minimize energy consumption and increase data throughput. Yet, the problem of radio interferences remain. However if th...
Tamás Lukovszki, Christian Schindelhauer, K...
« Prev « First page 1226 / 1273 Last » Next »