Sciweavers

17185 search results - page 3052 / 3437
» Computational and Quantitative Studies
Sort
View
SIROCCO
2008
15 years 9 months ago
Remembering without Memory: Tree Exploration by Asynchronous Oblivious Robots
In the effort to understand the algorithmic limitations of computing by a swarm of robots, the research has focused on the minimal capabilities that allow a problem to be solved. ...
Paola Flocchini, David Ilcinkas, Andrzej Pelc, Nic...
ACST
2006
15 years 9 months ago
PDC: Pattern discovery with confidence in DNA sequences
Pattern discovery in DNA sequences is one of the most challenging tasks in molecular biology and computer science. The main goal of pattern discovery in DNA sequences is to identi...
Yi Lu, Shiyong Lu, Farshad Fotouhi, Yan Sun, Zijia...
AIPS
2006
15 years 9 months ago
Combining Knowledge Compilation and Search for Conformant Probabilistic Planning
We present a new algorithm for conformant probabilistic planning, which for a given horizon produces a plan that maximizes the probability of success under quantified uncertainty ...
Jinbo Huang
CSREASAM
2006
15 years 9 months ago
Reinforcing Access Control Using Fuzzy Relation Equations
Current computer security systems are based on the premise that once a user presents valid credentials to the authentication system (e.g. valid ID and password), they are granted ...
Ali Berrached, André de Korvin
NETWORKING
2004
15 years 9 months ago
Bounds on Benefits and Harms of Adding Connections to Noncooperative Networks
Abstract. In computer networks (and, say, transportation networks), we can consider the situation where each user has its own routing decision so as to minimize noncooperatively th...
Hisao Kameda
« Prev « First page 3052 / 3437 Last » Next »