Sciweavers

197 search results - page 20 / 40
» Complexity of Max-SAT using stochastic algorithms
Sort
View
BMCBI
2007
160views more  BMCBI 2007»
15 years 2 months ago
Identifying protein complexes directly from high-throughput TAP data with Markov random fields
Background: Predicting protein complexes from experimental data remains a challenge due to limited resolution and stochastic errors of high-throughput methods. Current algorithms ...
Wasinee Rungsarityotin, Roland Krause, Arno Sch&ou...
PODC
2005
ACM
15 years 7 months ago
Routing complexity of faulty networks
One of the fundamental problems in distributed computing is how to efficiently perform routing in a faulty network in which each link fails with some probability. This paper inves...
Omer Angel, Itai Benjamini, Eran Ofek, Udi Wieder
VALUETOOLS
2006
ACM
164views Hardware» more  VALUETOOLS 2006»
15 years 7 months ago
Analysis of Markov reward models using zero-suppressed multi-terminal BDDs
High-level stochastic description methods such as stochastic Petri nets, stochastic UML statecharts etc., together with specifications of performance variables (PVs), enable a co...
Kai Lampka, Markus Siegle
CEC
2010
IEEE
14 years 5 months ago
A hybrid genetic algorithm for rescue path planning in uncertain adversarial environment
— Efficient vehicle path planning in hostile environment to carry out rescue or tactical logistic missions remains very challenging. Most approaches reported so far relies on key...
Jean Berger, Khaled Jabeur, Abdeslem Boukhtouta, A...
134
Voted
PEWASUN
2006
ACM
15 years 7 months ago
Wave propagation using the photon path map
In wireless network planning, much effort is spent on the improvement of the network and transport layer – especially for Mobile Ad Hoc Networks. Although in principle realworl...
Arne Schmitz, Leif Kobbelt