Sciweavers

650 search results - page 99 / 130
» Positive graphs
Sort
View
BMCBI
2008
96views more  BMCBI 2008»
13 years 10 months ago
Novel methodology for construction and pruning of quasi-median networks
Background: Visualising the evolutionary history of a set of sequences is a challenge for molecular phylogenetics. One approach is to use undirected graphs, such as median network...
Sarah C. Ayling, Terence A. Brown
ICRA
2008
IEEE
135views Robotics» more  ICRA 2008»
14 years 4 months ago
Decentralized connectivity maintenance in mobile networks with bounded inputs
Abstract— A distributed control law that guarantees connectivity maintenance in a network of multiple mobile agents is presented. The control law respects the limited sensing cap...
Dimos V. Dimarogonas, Karl Henrik Johansson
IJFCS
2006
111views more  IJFCS 2006»
13 years 9 months ago
Completeness and realizability: conditions for automatic generation of workflows
In recent years, workflow technology has greatly facilitated business process modeling and reengineering in information systems. On one hand, the separation of an application'...
Shiyong Lu, Arthur J. Bernstein, Philip M. Lewis
FORMATS
2010
Springer
13 years 7 months ago
Expected Reachability-Time Games
In an expected reachability-time game (ERTG) two players, Min and Max, move a token along the transitions of a probabilistic timed automaton, so as to minimise and maximise, respec...
Vojtech Forejt, Marta Z. Kwiatkowska, Gethin Norma...
SODA
2008
ACM
128views Algorithms» more  SODA 2008»
13 years 11 months ago
Analysis of greedy approximations with nonsubmodular potential functions
In this paper, we present two techniques to analyze greedy approximation with nonsubmodular functions restricted submodularity and shifted submodularity. As an application of the ...
Ding-Zhu Du, Ronald L. Graham, Panos M. Pardalos, ...