Sciweavers

3110 search results - page 550 / 622
» On the initialization of the DNMF algorithm
Sort
View
AIPS
2006
15 years 5 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
SODA
2004
ACM
111views Algorithms» more  SODA 2004»
15 years 5 months ago
Reconstructing strings from random traces
We are given a collection of m random subsequences (traces) of a string t of length n where each trace is obtained by deleting each bit in the string with probability q. Our goal ...
Tugkan Batu, Sampath Kannan, Sanjeev Khanna, Andre...
ADHOCNOW
2009
Springer
15 years 5 months ago
On Minimizing the Maximum Sensor Movement for Barrier Coverage of a Line Segment
We consider n mobile sensors located on a line containing a barrier represented by a finite line segment. Sensors form a wireless sensor network and are able to move within the lin...
Jurek Czyzowicz, Evangelos Kranakis, Danny Krizanc...
GECCO
2008
Springer
196views Optimization» more  GECCO 2008»
15 years 5 months ago
ADANN: automatic design of artificial neural networks
In this work an improvement of an initial approach to design Artificial Neural Networks to forecast Time Series is tackled, and the automatic process to design Artificial Neural N...
Juan Peralta, Germán Gutiérrez, Arac...
ADHOC
2007
113views more  ADHOC 2007»
15 years 4 months ago
Channelization for dynamic multi-frequency, multi-hop wireless cellular networks
Multi-hop relaying in cellular networks can greatly increase capacity and performance by exploiting the best available links to a base station. We envision an environment in which...
Jaesheung Shin, Raju Kumar, Parthu Kishen, Thomas ...