Sciweavers

3702 search results - page 630 / 741
» All Pairings Are in a Group
Sort
View
BMCBI
2007
105views more  BMCBI 2007»
15 years 6 months ago
Finding regulatory elements and regulatory motifs: a general probabilistic framework
Over the last two decades a large number of algorithms has been developed for regulatory motif finding. Here we show how many of these algorithms, especially those that model bind...
Erik van Nimwegen
EXPERT
2006
156views more  EXPERT 2006»
15 years 6 months ago
Computational Models of Ethical Reasoning: Challenges, Initial Steps, and Future Directions
on abstract principles that you can't easily apply in a formal, deductive fashion. So, the favorite tools of logicians and mathematicians, such as firstorder logic, aren'...
Bruce M. McLaren
JACIII
2008
148views more  JACIII 2008»
15 years 6 months ago
Optimal Route Based on Dynamic Programming for Road Networks
Abstract. One of the main functions of the traffic navigation systems is to find the optimal route to the destination. In this paper, we propose an iterative Q value updating algor...
Manoj Kanta Mainali, Kaoru Shimada, Shingo Mabu, K...
IJSN
2006
65views more  IJSN 2006»
15 years 6 months ago
The loop fallacy and deterministic serialisation in tracing intrusion connections through stepping stones
: In order to conceal their identity and origin, network based intruders seldom attack directly from their own hosts, but rather stage their attacks through intermediate `stepping ...
Xinyuan Wang
CORR
2007
Springer
92views Education» more  CORR 2007»
15 years 6 months ago
Throughput Scaling in Random Wireless Networks: A Non-Hierarchical Multipath Routing Strategy
— Franceschetti et al. [1] have recently shown that per-node throughput in an extended (i.e., geographically expanding), ad hoc wireless network with Θ(n) randomly distributed n...
Awlok Josan, Mingyan Liu, David L. Neuhoff, S. San...