Sciweavers

4171 search results - page 728 / 835
» Choice numbers of graphs
Sort
View
AI
2007
Springer
15 years 6 months ago
Computational properties of argument systems satisfying graph-theoretic constraints
One difficulty that arises in abstract argument systems is that many natural questions regarding argument acceptability are, in general, computationally intractable having been c...
Paul E. Dunne
JUCS
2006
117views more  JUCS 2006»
15 years 6 months 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...
167
Voted
TON
2010
152views more  TON 2010»
15 years 4 months ago
1 + N network protection for mesh networks: network coding-based protection using p-cycles
—p-Cycles have been proposed for preprovisioned 1 : N protection in optical mesh networks. Although the protection circuits are preconfigured, the detection of failures and the ...
Ahmed E. Kamal
BMCBI
2010
160views more  BMCBI 2010»
15 years 1 months ago
eHive: An Artificial Intelligence workflow system for genomic analysis
Background: The Ensembl project produces updates to its comparative genomics resources with each of its several releases per year. During each release cycle approximately two week...
Jessica Severin, Kathryn Beal, Albert J. Vilella, ...
PE
2011
Springer
167views Optimization» more  PE 2011»
15 years 1 months ago
Passage-time computation and aggregation strategies for large semi-Markov processes
High-level semi-Markov modelling paradigms such as semi-Markov stochastic Petri nets and process algebras are used to capture realistic performance models of computer and communic...
Marcel C. Guenther, Nicholas J. Dingle, Jeremy T. ...